Q4 — AO* with a Double Marker Switch
AND(B,C) wins, survives C's refinement, then G's true cost of 18 flips B onto primitive K — S lands at 28.
The Question
AND–OR decomposition. Double circles = primitive. Every edge costs 2. Tie-breakers: node labels; AND nodes expand the highest-cost unsolved branch first.
AND arcs: S = AND(B, C) or OR(A). A = AND(E, I) or OR(D). E = AND(H, I). B = AND(F, G) or OR(K). G = AND(J, K). C = AND(K, L). Primitives: H, I, J, K, L.
| # | Question | Official answer |
|---|---|---|
| 4.1 | Nodes expanded | S,C,B,G (also C,B,G) |
| 4.2 | Value of S after each expansion | 22,24,26,28 (also 24,26,28) |
| 4.3 | Conclusion about the heuristic | B — inadmissible |
The Topic in 60 Seconds
AO* = expand along marked arcs + revise (OR: min child+edge; AND: sum children+edges). Markers switch whenever a rival option undercuts the marked one. Primitive children make a node instantly SOLVED.
Deep-dive: AO* and Goal Trees.
The Trace — four expansions
h: S=10, A=30, B=6, C=12, E=4, F=1, G=3; H=2, I=4, J=6, K=8, L=2 primitive. Edge = 2.
Expansion 1 — S.
- AND(B, C):
- OR(A):
Mark AND(B, C) → S = 22 ✓
Expansion 2 — C (costlier AND branch: 12 > 6). C: AND(K, L) ; K, L primitive → C = 14, SOLVED. Propagate: ✓
Expansion 3 — B. B: AND(F, G) vs OR(K) → mark AND(F, G), B = 8. Propagate: ✓
Expansion 4 — G (marked path S→B→F,G; G(3) costlier than F(1)). G: AND(J, K) ; J, K primitive → G = 18, SOLVED. Propagate: AND(F, G) — worse than OR(K) ! Marker flips: B and C both solved → S SOLVED = 28 ✓✓
Final value of S = 28. Solution subtree: S → B→K and C→K,L.
Interactive trace:
Answers, decoded
- 4.1 — expansions: S, C, B, G (alternate
C,B,Gdrops S). - 4.2 — S after each: 22, 24, 26, 28 (alternate
24,26,28from C onwards). - 4.3 — B (inadmissible): . A's only solvable option is AND(E, I), and E's true cost is , so — a massive overestimate.
Tricks & Tips
Answers: 4.1 S,C,B,G · 4.2 22,24,26,28 · 4.3 B