Instructions

hide

Click within the white grid and drag your mouse to draw obstacles.
Drag the green node to set the start position.
Drag the purple node to set the end position.
Click and Drag the black node to draw the obstacles.
Choose an algorithm from the navigation bar.
Choose the heuristic and diagonal movement for that algorithm.
Heuristic is only for A*, Bidirectional A*, Best first & Bidirectional Best first.
Click Start Search in the navigation bar to start finding the path.
The BFS algorithm is Non-weighted so diagnonal distance is taken as 1 unit.
In all other Algorithms except BFS diagnonal distance is of Root(2) units and
perppendicular distances are of 1 unit.