Demos

Two interactive algorithm playgrounds: a live map of this site with shortest-path and MST tools, and a pathfinding visualizer with six search algorithms.

A live, force-directed map of every page on this site — nodes are pages, edges are the links connecting them. Drag nodes around, click any two to trace the shortest path between them, or toggle the minimum spanning tree.

This is normally an interactive, force-directed map of the site — drag pages around, click two to trace the shortest path between them, or reveal the minimum spanning tree. It needs JavaScript to run. Here's a plain list of every page instead:

drag nodes · tap two to find shortest path · double-tap (or double-click) to visit a page

Draw walls and terrain, place teleport portals, and race six pathfinding algorithms across the same board — BFS, Greedy Best-First, Dijkstra, A*, bidirectional BFS, and bidirectional Dijkstra.

This page is normally an interactive grid where you draw walls and terrain, then watch BFS, Greedy Best-First Search, Dijkstra, A*, bidirectional BFS, and bidirectional Dijkstra search it in real time. It needs JavaScript to run.

The short version: BFS and Greedy Best-First find a path fast but don't guarantee it's the cheapest one. Dijkstra, A*, and their bidirectional variants respect terrain cost and are guaranteed optimal — A* and the bidirectional versions just get there while visiting fewer cells.

brush: layout: add portals

pick an algorithm and hit visualize

start end wall sand, cost 3 mud, cost 5 water, cost 10 portal (tap "place portal", then two cells) visited path

pick a brush, then drag to paint. drag the start/end dots to move them, or use "set start"/"set end" for precise placement. portals teleport for a flat cost of 1. toggle "diagonal movement" for 8-directional moves. pick a grid size and layout preset, then hit "generate" for an instant maze, room set, or terrain map. keyboard: tab to the grid, arrow keys to move the cursor, enter or space to paint/place with whatever tool is active.