Pathfinder Algorithms

Interactive visualization of pathfinding algorithms // ground0.dev

// Algorithm

A* (A-star) Dijkstra's Breadth-First Search Depth-First Search

A* (A-star): Uses heuristics to find the shortest path efficiently. Optimal and complete.

// Controls

// Animation Speed

Fast Normal Slow

// Statistics

Visited

Path Length

0ms

Execution Time

// Legend

Start

End

Wall

Visited

Path

Current

Ready to start

Grid: 40 x 20

Instructions:
• Left Click + Drag to draw walls
• Shift + Click to set START point
• Alt/Option + Click to set END point
• Select an algorithm and click Run to visualize