Explores the influence of complexity on ergodic properties of symbolic systems, presenting the Curtis-Hedlund-Lyndon Theorem and constructions of minimal subshifts.
Covers planning with adversaries, heuristic search algorithms, and strategies for games with chance, emphasizing the significance of deliberative agents.