A* and Dijkstra's algorithm

You can help CodeWalrus stay online by donating here. | New CodeWalrus | Old (dark mode) | Old (light) | Discord server

A* and Dijkstra's algorithm - Pathfinding toy

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

ASTAR.rar
862.53 KB
downloaded 597 times

b/PC, Mac & Vintage Computers publicado por u/mazhat December 16, 2017, 05:25:40 PM

A* and Dijkstra's algorithm - Pathfinding toy

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.

Inicia sesión o crea una cuenta para dejar un comentario