Skip to content


This agent is a straightforward implementation of an eight-puzzle. It uses look-ahead search to solve the puzzle with a simple evaluation function. This agent also demonstrates chunking.

The puzzle consists of eight sliding tiles, numbered by digits from 1 to 8 arranged in a 3 by 3 array of nine cells. One of the cells is always empty, and any adjacent tile can be moved into the empty cell. The initial state is some arbitrary arrangement of the tiles. The goal state is the arrangement of tiles such that they are ordered from lowest to highest value. The problem is to find a sequence of moves from the initial state to the goal state.

External Environment


Soar Capabilities

  • Look-ahead subgoaling
  • Chunking

Default Rules

  • selection.soar

Associated Publications



John Laird

Soar Versions

  • Soar 8
  • Soar 9

Project Type