Problem
a) Does a finite state space always lead to a finite search tree? How about a finite state space that is a tree? Can you be more precise about what types of state spaces always lead to finite search trees?
b) An action such as Go(Sibiu) really consists of a long sequence of finer grained actions: turn on the car, release the brake, accelerate forward, and so on. Having composite actions of this kind reduces the number of steps in a solution sequence, thereby reducing the search time.