3.18

is an aamissible neunsnc tor the problem of moving the rook trom square A to square B in the smallest number of moves, Answer: Exercise 3.18 Consider a state space where the start state is number-1 and each state k has buo supoessers? numbers 2k and 2k+1 1. Dias the porton of the state space for states 1 it 15 : 2. Suppose the goal state is 11. List the order in which nodes ail be visted for breadthe first search, depth-imited search with limit 3 , and teraste deepening pearch: Aciswer