Question 2
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.
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.
Every move is reversible.
Every state has a path to every other state.
Some states have more than two neighbours.
Every state has exactly two neighbours.
Every state has exactly one neighbour.