Question 1
SEARCH
Consider a state space where each move is reversible and has 6 states (S,A,B,C,D,G) with S as start and G as goal. The heuristic function is:
Wherever applicable use alphabetical order.
Branch-and-Bound (BnB) algorithm is in mid-flight, the search tree as of the current moment is shown in the figure, where each node displays state and g-value.
Answer the sub-questions based on the information provided.
Make the necessary node refinements to complete the search tree like how Branch-and-Bound algorithm would have done before halting. How many times does each state occur in the final search tree? Enter the counts for S,A,B,C,D,G in the text box.
Enter a comma separated list of integers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answers Case Sensitive : No