Wythoff's Game

👥 2 players 📍 Indoor📍 Anywhere ⚡ Moderate 🧩 Moderate ⏱ 5-15 minutes 🎂 Ages 8+

Quick Pitch

Wythoff's Game is a mathematical strategy game with two heaps where players alternate removing objects, each turn either taking from one heap or equal amounts from both heaps, with the goal of being the last to move.

Hook

Two piles of objects sit between the players, and on each turn you either remove as many objects as you like from one pile, or remove the same number from both piles at once. Whoever takes the last object wins. The game looks like it's about counting, but there's a hidden pattern in the winning positions — and that pattern turns out to be connected to the golden ratio and the Fibonacci sequence, which makes this tiny two-pile game one of the most mathematically elegant puzzles in recreational math.

Equipment Needed

  • Objects to form two heaps: stones, sticks, coins, tokens, beans, or any countable objects
  • Recommended total: 20-30 objects for casual play, or adjust based on heap size
  • Two distinct heaps: Objects should be clearly separated into two visible piles
  • Flat surface: Table, ground, paper, or any space to arrange heaps
  • Optional: Paper and pen to track heap sizes (helpful for learning)

Setup

  1. Create two heaps with objects (start with 3-5 objects per heap for learning; 10-15 for serious play)
  2. Arrange heaps visibly on a flat surface
  3. Designate first player (randomly or by agreement)
  4. Play begins immediately

Rules

Objective

Be the last player to remove objects. The player who reduces both heaps to empty (0, 0) wins.

Gameplay

Turn Sequence: On your turn, make exactly one move—choose one of these two options:

  1. Single-heap move: Remove any number of objects from exactly one heap

    • You must take at least 1 object
    • You can take multiple objects from one heap
    • The other heap remains unchanged
    • Example: From (5, 7), remove 3 from the first heap → (2, 7)

  2. Symmetrical move: Remove the same number of objects from both heaps

    • You take identical quantities from each heap
    • You cannot take more objects than exist in either heap
    • Example: From (5, 7), remove 2 from both → (3, 5)
    • Example: From (10, 10), remove 1 from both → (9, 9)

Continue Playing:

  • Players alternate turns after each move
  • A turn changes the board state (represented as a pair of numbers: the two heap sizes)
  • Play continues until one player faces only (0, 0) remaining

Win Condition

  • The player who removes the last object(s) wins
  • Equivalently: the last player to move wins
  • When a player faces an empty board (0, 0), the previous player has won

Sample Game

Starting position: (3, 5)

Player 1: Removes 1 from first heap → (2, 5) Player 2: Removes 2 from both heaps → (0, 3) Player 1: Removes 3 from second heap → (0, 0) Player 1 wins! (made the last move)

Expert Player

Winning Strategy: The Wythoff Sequence

The key to mastering Wythoff's Game is understanding the Wythoff sequence—pairs of numbers representing losing positions for the player whose turn it is to move.

The Losing Positions

Memorize these small Wythoff pairs:

  • (0, 0) — Game over; previous player won
  • (1, 2) or (2, 1) — Equivalent positions (order irrelevant)
  • (3, 5) or (5, 3)
  • (4, 7) or (7, 4)
  • (6, 10) or (10, 6)
  • (8, 13) or (13, 8)
  • (9, 15) or (15, 9)
  • (11, 18), (12, 20), (14, 23), (16, 26), ...

Key insight: If you're facing a Wythoff pair, you're in a losing position (with perfect opponent play).

How the Sequence Works

The Wythoff sequence has mathematical elegance:

  • It's completely determined by the Fibonacci sequence
  • The ratio between the two numbers approaches the golden ratio (φ ≈ 1.618...)
  • The sequence has no gaps—every positive integer appears exactly once in the pairs

Winning Strategy Formula

  1. If your current position is NOT a Wythoff pair, you can always move to create a Wythoff pair for your opponent
  2. Once you create a Wythoff pair for your opponent, any move they make leaves you in a winning position
  3. Repeat this process until you win

Example: Winning Play from (5, 7)

Starting position: (5, 7) — This is NOT a Wythoff pair (the pair (4, 7) is close but not this)

Winning move: Remove 2 from both heaps → (3, 5)

You've created the Wythoff pair (3, 5) for your opponent!

Now your opponent is in a losing position. Any legal move they make (remove from one heap or both) will leave you in a winning position. You continue applying the strategy until you reach (0, 0) and win.

Tips for Learning

  1. Memorize small pairs: (1, 2), (3, 5), (4, 7), (6, 10) are the most useful
  2. Recognize patterns: After playing several games, you'll identify positions intuitively
  3. Calculate backwards: Think "If I want to win, what position should my opponent face?"
  4. Play both sides: Practice by analyzing each position to understand why Wythoff pairs are special
  5. Start simple: Begin with (3, 5) or (4, 7); build up to larger positions

Variations

Misère Play

Last player to move loses instead of winning. Strategy inverts completely; different Wythoff pairs apply. The starting position (1, 1) becomes a losing position for the player to move (instead of winning in normal play).

Different Starting Positions

Vary starting heap sizes to adjust difficulty:

  • Learning (easy): (1, 2), (2, 3), or (3, 4)
  • Casual play (medium): (5, 7), (6, 10), or (8, 13)
  • Challenge (hard): (10, 16), (13, 21), or (20, 32)
  • Very hard: Use larger Fibonacci numbers like (34, 55) or (55, 89)

Multiple Heaps

Extend the game to three or more heaps (becomes more complex; mathematical analysis is less elegant than binary Wythoff).

Time-Limited Moves

Add a timer to force faster decisions; strategic depth decreases but entertainment value may increase.

Learn More — History & Origins

History & Origins

Wythoff's Game was invented by Dutch mathematician Willem A. Wythoff in 1907. Wythoff proved mathematically that the game is completely solvable through the Wythoff sequence—an elegant pair sequence connected to Fibonacci numbers and the golden ratio. This work was revolutionary in combinatorial game theory, demonstrating that some games can be completely analyzed and played perfectly through mathematical analysis alone. Wythoff's research contributed foundational concepts to the broader field of impartial game theory.

Mathematical Significance

What makes Wythoff's Game remarkable is that its losing positions — the pairs of heap sizes that doom the player whose turn it is — follow a pattern directly tied to the golden ratio (φ ≈ 1.618). If you take any losing position (a, b) where a < b, then b/a approaches φ as the numbers get larger. The sequence of losing positions is (1,2), (3,5), (4,7), (6,10), (8,13) — and the ratio between the numbers in each pair creeps steadily toward 1.618. This connection isn't a coincidence: Wythoff proved that the sequence is generated by the floor function of multiples of φ, a result that ties together number theory, Fibonacci numbers, and combinatorial game theory in a way that mathematicians found genuinely surprising in 1907.

Cultural Context

Wythoff's Game occupies a niche shared by Nim and other mathematical take-away games: it's simple enough to explain in thirty seconds, but contains enough depth to sustain serious mathematical analysis. The game is a standard example in combinatorial game theory courses precisely because it's fully solved (there's a deterministic winning strategy from any non-losing starting position) yet the solution is elegant and non-obvious — you can't just count; you have to understand the structure. Recreational mathematicians and puzzle enthusiasts are drawn to games where the solution is hidden in the game's structure rather than brute-forced by memory, and Wythoff's connection to the golden ratio makes it one of the most aesthetically satisfying examples in all of mathematical game theory.

See Also