Chapter 5, Problem 1E

Explanation of Solution

Algorithm for finding optimal move

• The translation uses the model of the opponent to fill in the opponent’s actions leaving the actions to be determined by the search algorithm.
• The search problem is given by

  Initial state: P(S0) where S0 is the initial game state. P can be applied as the opponent may play first.

  Actions: defined as in the game by ACTIONSs.

  Successor function: RESULT′(s, a) = P(RESULT(s, a))

  Goal test: goals are terminal states

   Step cost: the cost of an action is zero.