The shoutbox is currently out of service. Join us on Discord instead.
You can help CodeWalrus stay online by donating here.

A* and Dijkstra's algorithm - Pathfinding toy

Started by mazhat, December 16, 2017, 05:25:40 pm

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

mazhat

Something I made for school, but I think you guys would like this.
The interface is not very well programmed, but it works (just barely).




Controls:
H- Change algorithms (From A* to Dijkstra and back)
C- Clear the board
LClick- Block Tile
RClick- UnBlock Tile
Enter/Return- Start the algorithm

Niches of these algorithms:
-Movement value is mathematically depressing: Going diagonally costs 1.4 units and not sqrt(2).
-You can always move diagonally to an open neighbor.

Remember to extract the file before running.
Sketti

Juju

Read Zarmina!
YUKI-CHAAAANNNN
In the beginning there was walrii. In the end there will be walrii. All hail our supreme leader :walrii: --Snektron



if you wanna throw money at me and/or CodeWalrus monthly it's here

Powered by EzPortal