Tutorials
Twelve Wednesday tutorials: what to predict before, what happens in the two hours, and what you leave with.
Two hours each, the same shape every week: predict and compute by hand, derive or trace a small example, implement and compare, then test and explain. Every tutorial opens on its own with its case loaded, and later weeks are never locked behind earlier ones. Start with the computed example and its main comparison button. Expand the two-hour guide for preparation, coding and checks; expand the tools when you want to change more inputs. The page's spec states what you should be able to do by the end.
Model legal edges, trace Dijkstra, and explain A*.
Week 1: Check a legal route
Hand-compute the available candidate routes on the ten-node block graph, find the edge that passes through a building, and draw the task state diagram.
Week 2: Catch an early stop
Trace a wrong implementation, complete the search core, and test the four cases that catch it.
Week 3: Reopen a better route
An admissible but inconsistent heuristic on a four-edge graph: predict, trace, find the bug, fix re-expansion, then compare h = 0 with a legal heuristic.
Keep time and energy labels for a complete delivery.
Week 4: Keep the route home
Ridge or contour: complete the budget and dominance checks, show what single-label pruning loses, confirm by enumeration.
Declare an objective and test local improvement.
Week 5: Order six dinners
Compute the first orders by hand, implement the recurrence, and compare FIFO with earliest-deadline on the course's objective.
Week 6: Compare swaps with all 720
Implement a swap improver, find where it stops, and measure its exact gap against all 720 permutations.
Assign capable drones and share the charging pads.
Week 7: Assign the hotpot
Assign #01–#09 and #20 across three drones, then two types; build an equal-counts, unequal-time counterexample.
Week 8: Trace the pad queue
Schedule a two-drone, one-pad case by hand, run the five-drone, two-pad case, and locate where shared charging changes the answer.
Reserve shared airspace and feed delays back into the plan.
Week 9: Clear the corridor
Mark the conflict between two independent trajectories, complete the reservation query, and show the spatial-visited bug at the waiting point.
Week 10: Change the planning priority
Complete neighbour generation and reservation filtering, compare two priorities, and add a failed-reservation rollback test.
Week 11: Explain a feedback change
Compare independent-cost assignment, fixed assignment with coordination, and assignment with cost feedback; trace one order through the chain.
Week 12: Audit a complete evening
Run the final plan, trace one late or unscheduled order to its cause, and reproduce someone else's conclusion.