Pathfinding

Educational

Build grids with walls and weights, then watch algorithms find the optimal path!

Algorithm

A* uses a heuristic to estimate distance to goal, making it faster than Dijkstra for most cases.

Movement

Speed: 50%

Tools

Click to place start (green) and goal (red) points

Path Found-

Path Length-

Path Cost-

Nodes Expanded-

Runtime-

Score-

Start

Goal

Wall

Mud (5)

Water (10)

Visited

Frontier

Path

Shortcuts

Space: Run/Pause

R: Reset | C: Clear

1-3: Algorithm