1. use breath-first search to (1) find a sequence of actions that can travel from state A to state G, (2) calculate the corresponding path cost, and (3) visualize the final search tree.

2. use uniform-cost search to (1) find a sequence of actions that can travel from state A to state G, (2) calculate the corresponding path cost, and (3) visualize the final search tree.

Transcribed Image Text:

8 A A B 4 B 5 8 15 3 D F 6 15 G E In this diagram, each node represents a state, and each directed edge represents a transition action. For 8 10 example, means there is an action from state A to state B and this action has a step cost of 8. Note that since there is no directed edge starting from state B to state A, there is no action available from transiting from state B to state A. The yellow state A is the initial state, and the red state G is the goal state. 8 A A B 4 B 5 8 15 3 D F 6 15 G E In this diagram, each node represents a state, and each directed edge represents a transition action. For 8 10 example, means there is an action from state A to state B and this action has a step cost of 8. Note that since there is no directed edge starting from state B to state A, there is no action available from transiting from state B to state A. The yellow state A is the initial state, and the red state G is the goal state.