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

AI: Search Methods for Problem Solving · Quiz 1 · 26 Oct 2025 · September 2025 term

Question 1: STATE SPACE\ Consider 3-puzzle (a smaller version of 8-pu…

Question 1

+1 markOne or more correct options

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 all that apply.

A
State A
B
State B
C
State C
D
State D

Show answer

Correct answers

B
State B
C
State C

See the whole paper Take it as a mock test

Question 1 of 20 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 26 Oct 2025, in the September 2025 term (IIT M DEGREE AN EXAM QDB2 26 Oct 2025). It carries 1 mark.

Question 1: STATE SPACE\ Consider 3-puzzle (a smaller version of 8-pu…

Question 1

More questions from this paper