2023 Term 3 · Forenoon — Worked Solutions
Every question solved from scratch: the reasoning, the algorithm trace, and the shortcuts that get you to the answer fast.
Q1 — Search: BFS/A*/BnB
Search algorithms on a grid map
Q2 — TSP Branch-and-Bound
TSP BnB tree reading
Q3 — Games: Strategy + Alpha-Beta
Game tree strategies and pruning
Q4 — AO* Problem Decomposition
Marker starts on the cheap AND-connector, C's primitives sting it to 21, A's expansion ties - and D's hidden depth explains the keyed 22-to-20 finish.
Q5 — Rete Expert System
Mushroom net with negated colour tests and a three-way beta chain: the join topology alone decides which tuples may exist, specificity picks the deepest.
Q6 — Planning: Applicable/Relevant/Mutex
The Blocks World four-pack on the FN instance: two arm actions fire, three goal-writers matter, and the layer-1 arm clique generates every mutex.
Q7 — Waltz Line Labeling
Dictionary in the arrow notation: how a Y-W-Y-W chain of forced labels emerges around a silhouette, and what makes each next label inevitable.