84.2 Information Driven Search Assume that among m possible states in search space, the present state is x, and goal state is x ng IfI(Cmo)>Ⅳ(吵> mo >IC search continues Otherwise, search stops The optimum solution can be obtained by the calculation: k (5 )=MaxI(s§4.2 Information Driven Search Assume that among M possible states in search space, the present state is X , and goal state is X . mo mg If I( ) > I( ) > … > I( ), search continues; m(k+1) mk mo Otherwise, search stops. The optimum solution can be obtained by the calculation: I( ) = Max I( ) mk mk 0 k