Deck · IOI — Competitive Programming

Combinatorial Game Theory

Combinatorial games for competitive programming: N/P positions, Nim and the Nim-sum theorem, mex and Grundy values, the Sprague-Grundy theorem, sums of games, subtraction-game periodicity, Nim variants (staircase, Moore, Wythoff), Hackenbush and coin-turning concepts, and minimax with alpha-beta pruning.

49 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

1

Combinatorial game (definition)

2

Normal vs misère play

3

Impartial vs partizan games

4

N-positions and P-positions

5

Recursive characterization of N/P positions

Showing 5 of 49 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Advanced Computational Geometry49 cardsAdvanced Graph Algorithms, Flows & Matching63 cardsGeneral Algorithmic Techniques & Analysis79 cardsCombinatorics & Counting66 cardsFundamental Data Structures78 cardsDynamic Programming81 cards

Master combinatorial game theory — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →