Artificial intelligence

=================

branch and bound is with A* or DP.(both)

Exercise 6 Draw the state search tree uing the plain vanilla branch and bound to get from the start node (S) to the goal node (G) in the following Figure. When all else is equal, explore nodes in alphabetical order. 1 2 4 S C F 3 E A B G 1