Question 1

**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. Figure from the passage in the original paper The start state is **(RR-L)** , 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-21.\ 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. Figure from the passage in the original paper The start state is **(RR-L)** , 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-21.\ Based on the above data, answer the given subquestions. From (RR-L) , the minimum number of moves needed to reach (L-RR) 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. Figure from the passage in the original paper The start state is **(RR-L)** , 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-21.\ Based on the above data, answer the given subquestions. For Graph-21, when there is a path from some start state to some goal state, \_\_\_\_\_\_\_\_\_\_ .