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.
State A
State B
State C
State D
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.
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.
The number of unique states in Graph-1230 is __________ .
less than 8
equal to 8
more than 8
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
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: 20 questions for 20 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | AI Search Methods Quiz 1 26 Oct 2025 at a glance |
|---|---|
| Term | September 2025 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 20 |
| Marks | 20 |
| Duration | 120 min |
| MSQ | 4 |
| MCQ | 3 |
| Written | 11 |
| Numerical | 2 |
| Official paper | IIT M DEGREE AN EXAM QDB2 26 Oct 2025 |
| Negative marking | No negative marking. |
| Updated |
