Theory of Heuristic Information in Game-Tree Search

A solution to this problem is a sequence of moves leading from the initial configuration to the goal configuration, and an optimal solution is a solution having the smallest number of moves.