← MAIN
02 // STATE-SPACE SEARCH
N-PUZZLE AI
A* · BFS · DFS · IDS · Greedy Best-First · UCS
ALGORITHM — MOVES — NODES — STATUS IDLE
SOLUTION PROGRESS 0 / 0
SEARCH LOG
LOG EVERY
// Search log will appear here once solved
PUZZLE SETUP
PUZZLE SIZE
INITIAL STATE (comma-separated, 0 = blank)
ALGORITHM
Finds the optimal path using f = g(n) + h(n). Guaranteed to find the shortest solution.
SOLVER STATS
PATH LENGTH —
NODES EXPANDED —
MAX SEARCH DEPTH —
SOLVE TIME —
CURRENT STEP —
ALGORITHM NOTES
HEURISTIC: MANHATTAN DISTANCE
Sum of distances each tile must travel to reach its goal. Admissible — never overestimates the true cost.
⚠ BFS / DFS / IDS ON 15-PUZZLE
15-Puzzle has ~10¹³ states. BFS/DFS/IDS are capped at 500k nodes. Use A* or Greedy for 15-Puzzle.