Question: Consider the problem of solving two 8-puzzles: there are two 8-puzzle boards, you can make a move on either one, and the goal is to
Consider the problem of solving two 8-puzzles: there are two 8-puzzle boards, you can make a move on either one, and the goal is to solve both.
a. Give a complete problem formulation.
b. How large is the reachable state space? Give an exact numerical expression.
c. Suppose we make the problem adversarial as follows: two players take turns moving; a coin is flipped to determine the puzzle on which to make a move in that turn: heads puzzle one; tails puzzle two. The winner is the first to solve either puzzle. Which algorithm can be used to choose a move in this setting?
d. In the adversarial problem, will one player eventually win if both play perfectly?
Step by Step Solution
3.34 Rating (157 Votes )
There are 3 Steps involved in it
a Initial state two arbitrary 8puzzle states Successor function one move on an unsolved puzz... View full answer
Get step-by-step solutions from verified subject matter experts
