Playground

Things that are easier to understand by moving than by reading. Each one runs entirely in the browser — no server, nothing stored.

• A* pathfinding

  Draw walls, drag the endpoints, and watch how much of the map the search has to look at. The heuristic weight turns it from Dijkstra into A* into something greedy that stops finding the shortest route.

  Algorithms