Zermelo
Capture the final square.
Two teams move a shared coin around a board of English questions. You cannot revisit a square, so the board closes in as you play — and the win comes from leaving your opponent nowhere legal to go.
- Grouping
- 2 teams
- Swap your own content in at
- The QUESTIONS array at the top of the script — { q, options, correct } objects, assigned to cells in board order.
Additional info
The grid comes from Exercise 2.12 of Giacomo Bonanno’s open-access Game Theory (arXiv:1512.06808) — a two-player, perfect-information coin-moving game. Two presets ship with it: a main 8×9 board and a mini 6×6 for shorter classes.
The largest payout is occupying the “END” square first (which presents the highest potential payoff for a correctly answered question); the second largest is from “trapping” your opponent so they have no remaining legal moves (presents second-highest potential payoff).