2026 Term 1 · 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: Water Jug BFS
Same three move-types, fresh endpoints: three pours carry 320 to 401 and BFS level-counting proves nothing shorter exists.
Q2 — Search Algorithms Theory
DFID's closed-list secret, the two survivors of an unknown heuristic under arbitrary costs, and why w = 0 turns wA* into Dijkstra.
Q3 — Games: Alpha-Beta Pruning Puzzle
The mirror-image puzzle: low values go first, both cuts are alpha-type, and the subtree still resolves to exactly 2.
Q4 — Games: SSS* Algorithm
MIN root over three MAX circles: SSS* crowns four leaves SOLVED and purges three of them when their ancestors lock in.
Q4 — AO* Problem Decomposition
B's connector steals the marker first, A and C trade it twice, and the shared primitives G/H settle S at 28.
Q5 — Rule Based Expert Systems
The mushroom net's FN twin: same four-tuple conflict set shape, specificity crowns the join-backed pair, recency hands it to option B.
Q7 — Automated Planning Theory
The FN flip: which overlaps make two orderings DIVERGE, the interference half of GraphPlan's mutex definition, and the one true monotonicity statement.
Q8 — Automated Planning: GraphPlan
The FN instance ends in NIL: the layer machinery runs to fixed point, the goal pair never appears non-mutex, and GraphPlan correctly reports no plan.
Q9 — Constraint Satisfaction: AC and PC
Mod-relations with a twist of 3s and 4s: tables computed cell by cell, arc-consistency trims the fat, and the unique solution reads 2,2,1.