Click a cell → S | Click another → T
Maze Generation
Width18
Height13
Navigate
Speed
med
Results
You — your steps—
↳ backtracks—
d_g — GSN steps—
d — shortest path—
d_r — random DFS—
backtracks—
ν = d / d_g—
How it works
GSN always moves to the unvisited neighbor whose direction most closely aligns with the target — angle θ between vi→t and vi→j. Backtracks only when all neighbors visited.
SPN follows the guaranteed optimal path (BFS). Requires complete map knowledge.
Random DFS is a self-avoiding walk — random unvisited neighbor each step, backtracking only when truly stuck.
SPN follows the guaranteed optimal path (BFS). Requires complete map knowledge.
Random DFS is a self-avoiding walk — random unvisited neighbor each step, backtracking only when truly stuck.
PATH LOG
Generate a maze, then click two cells.