Maze Solver
Fill mode
Blocks
Target
Location
Weights
Solving algorithm:
Dijkstra's algorithm
A* search algorithm
Uniform Cost Search
Breadth-first search
Depth-first search
Iterative Deepening DFS
Bidirectional Search
Local Beam Search
Greedy Best-First Search
Rapidly-exploring Random Tree (RRT)
Heuristic:
Manhattan distance
Diagonal distance
Euclidean distance
Chebyshev distance
Octile distance
Minkowski distance
Beam Width:
Directions:
8 Directions
4 Directions
Find
Cell count per row
Reset
Source code