Search Algorithms Demo

Build a state space graph and run search algorithms defined in Russell & Norvig's AIMA.

Click anywhere on the canvas to place a node. Double-click any node to rename it. Edges are created and edited in the Edges table below — use "Move Edge" mode to drag their curves. Drag the panel's bottom edge to resize it.

Edges

Each row is one action: source state, target state, action name, and its step cost (new edges default to a cost of 1 — edit directly, or use the buttons below to set every edge at once). Uncheck "Undirected" to make the action usable only source → target. A source and target can be the same state (a self-loop). Multiple edges between the same pair, or on the same node, are drawn as separate arcs/loops — switch to "Move Edge" mode above and drag a curve to reposition it, e.g. to stop it overlapping another edge or hiding a label. Drag the bottom edge of this panel to resize.

Heuristic Values (used as heuristic h(n) for Greedy/A*)

Editable directly. Every pair defaults to 0 until you apply a mode below. "Apply to All Pairs" recomputes every entry using the chosen mode. Drag the bottom edge to resize.

Search Algorithm Visualizer

Goal states
Frontier Expanded Just expanded Solution path Stale (superseded, graph search)
Choose a start node and check one or more goal states, then press Step or Run.