2024 Term 3 · Afternoon — Worked Solutions

Every question solved from scratch: the reasoning, the algorithm trace, and the shortcuts that get you to the answer fast.

Q1SEARCH

Q1 — Best First Search, A* and Branch-and-Bound on the Grid Map

Best First dives at D, A* settles for 14, and Branch-and-Bound uncovers the cost-12 eastern route through E and C.

Best First SearchA*Branch-and-BoundAdmissibility
Q2TSP BRANCH-AND-BOUND

Q2 — TSP Branch-and-Bound: a Small Tree, Fully Resolved

Only four refinements deep — b1, c2, d1 and the leaf d1 pops at 162 with the five-city tour A,D,B,C,E.

TSPBranch-and-BoundTour reconstruction
Q3GAMES

Q3 — Game Trees: Strategies, Best Strategy, Dead Leaves, SSS*

Two game trees — strategies B and D, best line B,E at 66, dead leaves D,E,G,H, and SSS* solving A,B,C,F.

MinimaxGame strategiesSSS*Dead leaves
Q4AUTOMATED PLANNING

Q4 — Blocks World: Applicable vs Relevant, Planning-Graph Mutexes

The arm holds A over the D-on-C stack — four layer-1 checks with Pickup/Stack/Unstack candidates.

STRIPSBlocks worldApplicable actionsRelevant actionsGraphPlanMutex
Q5PROBLEM DECOMPOSITION

Q5 — AO* on an AND–OR Decomposition

OR(C) wins at 16, the marker flips twice, and S settles at 32 after E's primitive escape closes out.

AO*AND-OR graphsCost revisionMarker switching
Q6RULE BASED EXPERT SYSTEMS

Q6 — Rete Net: Property Classification

Properties, amenities and localities joined on pno — the conflict set narrows to two tuples and recency picks the newest.

Rete algorithmConflict setSpecificityRecency
Q7CONSTRAINT SATISFACTION

Q7 — Waltz Line Labeling: One Solvable, One NIL

A rare consistent drawing — junctions 1–4 label as L2, Y1, L3, W3 — while the second drawing wipes out to NIL.

Waltz labelingLine drawingsConstraint propagationTrihedral junctions