Paths, games and optimality

Search legal states, count routes and prove a strategy works using bounds, constructions and complete case analysis.

Describe a state and distinguish counting from optimisation.

Prove a bound and supply a legal construction reaching it.

Verify every branch of a finite strategy.