Question 1

**STATE SPACE**\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one position either horizontally or vertically into the **adjacent empty spot,** effectively swapping the tile and the adjacent empty spot. A tile cannot slide diagonally. Figure from the passage in the original paper Begin from the start state and build the state space graph by generating valid moves, call it Graph- 1230, use this graph to answer the sub-questions. Question asking which of four 8-puzzle-style states A to D can be reached in exactly three moves, with the state figures **STATE SPACE**\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one position either horizontally or vertically into the **adjacent empty spot,** effectively swapping the tile and the adjacent empty spot. A tile cannot slide diagonally. Figure from the passage in the original paper Begin from the start state and build the state space graph by generating valid moves, call it Graph- 1230, use this graph to answer the sub-questions. Select the statements that are true about Graph-1230. **STATE SPACE**\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one position either horizontally or vertically into the **adjacent empty spot,** effectively swapping the tile and the adjacent empty spot. A tile cannot slide diagonally. Figure from the passage in the original paper Begin from the start state and build the state space graph by generating valid moves, call it Graph- 1230, use this graph to answer the sub-questions. The number of unique states in Graph-1230 is \_\_\_\_\_\_\_\_\_\_ .