A online algorithm visualiser for pathfinding algorithms.
Two grid modes are supported with additional options:
| Grid Mode Blockwise | Grid Mode Edgewise |
|---|---|
 |
 |
| In this mode, each node can be blocked. | In this mode, each edge can be blocked per direction. |
 |
 |
| + option crossing corners allowed. | Each blue object blocks a direction. |
 |
|
| + option cardinal paths only. |
| Algorithm | Description |
|---|---|
| Dijkstra | The Dijkstra Pathfinding Algorithm |
| A* | The A* Pathfinding Algorithm |
| DJPS | The Directed Jump Point Search Algorithm (alternative Version) |
| DJPS Lookup | The Directed Jump Point Search Lookup Algorithm using pre-calculated lookup data |
| DJPS Pre-Calculation | The Directed Jump Point Search Pre-Calculation Algorithm using backwards pre-calculation |
| Heuristics | Description |
|---|---|
| Chebyshev | The Chebyshev distance as heuristic. This distance is calculated by the moves a chess king would have to make. |
| Euclidean | The Euclidean distance as heuristic. This distance is calculated as the crow flies. |
| Octile | The octile distance as heuristic. This distance is calculated by the length of the octile path. |
| Manhattan | The Manhattan distance as heuristic. This distance is calculated by summing the difference of the x and the y coordinates. |
- Premsing Rathod
- Pratik Barai
- Ajinkya Hazare
- Piyush Itankar