July 09, 2020, 09:11:46 pm

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

WARNING: DO NOT UPGRADE your TI-83 Premium CE or TI-84 Plus CE to OS 5.5.1 and higher. It removes all compatibility with most games and removes ASM/C programming! DOWNGRADING IS IMPOSSIBLE. BE WARNED! Likewise, do NOT update your TI-Nspire CX past OS 4.5.0, else using Ndless and ASM/C programs will be impossible.

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

Yuki

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