Week 9 — Goal Trees

When one goal splits into many mandatory subgoals — A* grows up, leaves path-land, and starts solving subtrees. Asked in every paper

  1. AND-OR Trees and the AO* Algorithm

    When one goal splits into many mandatory subgoals — A* grows up, leaves path-land, and starts solving subtrees. Asked in every paper

  2. Graphplan and Mutual Exclusion

    Build the space of all possible plans as a layered graph, then hunt mutex pairs — the technique that jumped planning from 15 to 200 steps

  3. Action Ordering and GraphPlan Properties

    When does order matter? When do mutexes persist? The theoretical edge cases that become multiple-choice traps

  4. GraphPlan Mid-Flight Layer Reasoning

    Given layers k and k+1 mid-planning-graph — can layer k be a state? Which actions apply next? Why are two facts (non-)mutex? The 25T3 question family

  5. Means-Ends Analysis and the General Problem Solver

    Reason like a human planner — find the biggest difference, pick the operator that kills it, recurse on preconditions. Newell & Simon's GPS

  6. Goal Trees and Deduction in Logic

    Proof search is AND-OR search — modus ponens, forward vs backward chaining, unification with variables, and why AO* can prove theorems