Visualize

Breadth-first search

Depth-first search

Greedy best-first search

Dijkstra's algorithm

A* search

Very fast

Fast

Medium

Slow

Very slow

Switch to hexagon grid Clear walls Clear trees Hold 'Shift' to add
weighted tiles (trees)