⬡ PATHFINDER

A* · Dijkstra · Greedy BFS — vanilla JS, no libraries

Draw

Algorithm

Move

Speed 20×

A* Search

NO PATH EXISTS

Explored

—

Path Length

—

Path Cost

—

Time

—

A*

Explored

—

Path

—

Cost

—

Time

—

Dijkstra

Explored

—

Path

—

Cost

—

Time

—

Greedy BFS

Explored

—

Path

—

Cost

—

Time

—

Start

End

Wall

Open (frontier)

Closed (visited)

Path

Space=Run · Enter=Step · R=Reset · M=Maze · C=Clear