13.3 Consider the route-finding problem of Figure 12.2. How many nodes are generated by A*, IDA* and RBFS on this problem (counting also the regenerated nodes)? 13.4 Consider the state space in Figure 13.5. Let a be the start node and the goal node. Give the order in which nodes are generated (including regeneration) by the RBFS

algorithm. How are the backed-up values F

(b) and F

(c) changing during this process?

Transcribed Image Text:

P a g h k 16 6, m 5