Learn how to navigate the 8-puzzle, compare search algorithms, and interpret the AI-driven analysis for deeper insights.

Manual Mode

The 8-puzzle consists of a 3×3 grid with 8 numbered tiles and one empty space. Click any tile adjacent to the empty space to slide it into position. Your goal is to reach the ordered state:

1 2 3 / 4 5 6 / 7 8 _

Automated Search

Use the algorithm buttons in the Algorithm Stream panel to let the computer solve the puzzle for you. Each algorithm offers a different approach to finding the solution:

  • A* (A-Star): Uses a heuristic (Manhattan distance) to estimate the cost to the goal. It finds the shortest path efficiently by expanding fewer nodes.
  • BFS (Breadth-First Search): Explores the search space level-by-level. It guarantees the shortest path but visits significantly more nodes than A*.
  • UCS (Uniform Cost Search): Finds the shortest path based on step cost. In this puzzle, where every move costs 1, it behaves similarly to BFS but is conceptually distinct.

AI Analysis

After running an algorithm, click the "Generate Analysis" button to get a detailed breakdown of the solution. Powered by Groq's LLM, this feature explains why the algorithm chose the specific path, identifies key moves, and provides efficiency metrics.