Every lesson in the Artificial Intelligence slide course, in full text: 1 deck, 60 slides.
Session 1 - Adversarial Search, and Why 25 Moves Are Really 6A graduate AI session built around the exact gap the student reported: a lecture asserting that the 25 opening moves of 5-by-5 Isolation reduce to 6 without naming the machinery behind it. Part 1 supplies that machinery in full - the eight symmetries of the square, orbits, the reason cells on a mirror line have small orbits on an odd-sized board, and Burnside's lemma as an independent check on the count of six. The rest builds the standard adversarial search ladder on top: minimax by hand, why depth limits and evaluation functions are forced, the horizon effect, alpha-beta pruning traced through the same tree, and iterative deepening. The closing part is a reading method for spotting the difference between a missing name and a missing minute.
Want this taught 1-on-1? Alexander tutors Artificial Intelligence — $55/session, free consultation.