Dijkstra's

Greedy Best-First

Random walk

slow

medium

fast

no delay

weight value: 3

Begin

End

Waypoints

Walls

Weights

×

How does it work?

left-click can be used to place and remove walls.
click and drag an empty (white) node to create walls.
click and drag a wall to create empty nodes.

right-click (or alt + left-click) and drag to create weights.

click the middle mouse button (or shift + left-click) to create up to 3 waypoints.

×

Failed to find a path

the algorithm has failed to find its destination

This is most likely because there is no possible path.

begin

destination

normal node

wall (can not pass)

weighted node (preferred to avoid)

already visited node

waypoint

shortest path