AI Search Methods Quiz 1: 29 October 2023 (September 2023 term)

STATE SPACE
Recall the rabbits crossing puzzle from the practice assignment. Two groups of rabbits, each group at opposite ends of a path, want to cross the path by making only forward jumps: a rabbit can jump forward to an adjacent empty spot, or jump forward over one rabbit and land in an empty spot.

The start state is (R-LL), where R is a rabbit that wants to go right, and L is a rabbit that wants to go left, and the dash marks the empty spot.
Construct all the states that are reachable from the start state and build a state space graph out of those states, call it Graph-12.
Based on the above data, answer the given subquestions.

Which of the following states are reachable from the start state in exactly 3 moves?

STATE SPACE
Recall the rabbits crossing puzzle from the practice assignment. Two groups of rabbits, each group at opposite ends of a path, want to cross the path by making only forward jumps: a rabbit can jump forward to an adjacent empty spot, or jump forward over one rabbit and land in an empty spot.

The start state is (R-LL), where R is a rabbit that wants to go right, and L is a rabbit that wants to go left, and the dash marks the empty spot.
Construct all the states that are reachable from the start state and build a state space graph out of those states, call it Graph-12.
Based on the above data, answer the given subquestions.

From (R-LL), the minimum number of moves needed to reach (LL-R) is __________ .

STATE SPACE
Recall the rabbits crossing puzzle from the practice assignment. Two groups of rabbits, each group at opposite ends of a path, want to cross the path by making only forward jumps: a rabbit can jump forward to an adjacent empty spot, or jump forward over one rabbit and land in an empty spot.

The start state is (R-LL), where R is a rabbit that wants to go right, and L is a rabbit that wants to go left, and the dash marks the empty spot.
Construct all the states that are reachable from the start state and build a state space graph out of those states, call it Graph-12.
Based on the above data, answer the given subquestions.

For Graph-12, which of the following algorithms will find the shortest path from (R-LL) to (LL-R)? Assume a suitable MoveGen order for each algorithm.