Pathfinding & Maze Visualizer

Dijkstra plus a guess. Each cell is scored by the distance already travelled plus an estimate of what remains, so the search leans toward the target instead of spreading evenly.

Watch for: The search stretching toward the goal rather than growing as a circle.

Optimality: Yes, with an admissible heuristic. A swamp cell costs 6 to enter instead of 1 — paint some, then compare Dijkstra against breadth-first to see the difference it makes.