Question 9
PROBLEM DECOMPOSITION
The figure shows an AND-OR decomposition of problem S into subproblems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node displays its heuristic cost, but primitive nodes (double border) display the actual cost. Primitive nodes attain SOLVED status when their parent is expanded, so primitive nodes are never expanded. The cost of each edge is 2 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.
Use AO* algorithm to solve S, then answer the given sub-questions.
For each node expanded by AO* algorithm, determine the value assigned/propagated to the start node S. Enter the values of S in the time order, in the order it was updated. Enter a comma separated list of integers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answers Case Sensitive : No