CodeWalrus

Development => PC, Mac & Vintage Computers => Topic started by: mazhat on December 16, 2017, 05:25:40 PM

Title: A* and Dijkstra's algorithm - Pathfinding toy
Post by: mazhat on December 16, 2017, 05:25:40 PM
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).

https://www.youtube.com/watch?v=sGd9L5-JAyU


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.
Title: Re: A* and Dijkstra's algorithm - Pathfinding toy
Post by: Yuki on December 16, 2017, 07:27:25 PM
Oh nice. Gotta love A*.