Sprouts: The Brilliant Pencil Game Invented at Cambridge

Quick Info

Players
2
Equipment
Paper & pencil
Difficulty
Easy rules / Deep strategy
Game Length
5–15 minutes
Invented
1967 by John Conway & Michael Paterson

Introduction

Sprouts is one of the most elegant games ever devised. It was invented on 21 February 1967 during an afternoon tea break at the Department of Pure Mathematics and Mathematical Statistics at Cambridge University, England. Two mathematicians — John Horton Conway and Michael Stewart Paterson — were sketching ideas on a piece of paper when they stumbled upon a deceptively simple set of rules that would captivate mathematicians, puzzle enthusiasts, and casual players for decades to come.

Despite requiring nothing more than a pencil and a scrap of paper, Sprouts contains extraordinary mathematical depth. Every game is connected to graph theory, one of the most important branches of modern mathematics. The spots are vertices, the curves are edges, and the constraint that lines cannot cross each other means every Sprouts position is a planar graph. The rule that each spot can have at most three connections corresponds to a maximum vertex degree of three, and Euler’s formula for planar graphs guarantees that every game must eventually end.

What makes Sprouts remarkable is the contrast between the simplicity of its rules and the complexity of its strategy. A child can learn to play in under a minute, yet the game has resisted complete mathematical analysis for more than half a century. Computer scientists have solved Sprouts for small numbers of starting spots, but a general formula that determines the winner for any starting position remains one of the open problems in combinatorial game theory.

What You Need

One of the greatest appeals of Sprouts is that it requires virtually nothing to play. Here is your complete equipment list:

That is genuinely it. No board, no dice, no cards, no app. Sprouts is the perfect game for a waiting room, a long train journey, a quiet evening at home, or a classroom break. It is often cited as one of the best games you can play with absolutely no equipment beyond what you can find in any pocket or desk drawer.

Setup

Setting up a game of Sprouts takes approximately five seconds:

  1. Draw n spots on the paper Place a small number of dots (called “spots”) on a blank area of the paper. The standard game begins with 3 spots, arranged in a rough triangle with plenty of space between them. You can start with any number of spots, but 3 is the traditional starting point and produces a game of 6 to 8 moves — perfect for learning the rules.
  2. Leave plenty of space Make sure the spots are well separated and that there is ample blank paper surrounding them. As the game progresses, curves will weave between existing lines, and the board becomes increasingly crowded. Starting with well-spaced spots gives you room to manoeuvre.
  3. Decide who goes first Players choose who takes the first turn by any agreed method — a coin flip, rock-paper-scissors, or simply alternating from game to game. In competitive Sprouts, going first or second can be a significant advantage depending on the number of starting spots.
Starting Spot Suggestions
  • 2 spots — a very short game (4–5 moves), good for a quick demonstration
  • 3 spots — the classic game (6–8 moves), ideal for beginners and experienced players alike
  • 4–5 spots — a medium-length game, good when you want more strategic depth
  • 6+ spots — a longer, more complex game for dedicated Sprouts enthusiasts

How to Play

Players take turns in alternation. On each turn, a player must perform exactly two actions: draw a curve, then place a new spot. Here are the complete rules:

  1. Draw a curve connecting any two spots (or a loop from a spot back to itself) The curve can be any shape — straight, curved, looping — as long as it starts at one living spot and ends at another living spot (or the same spot, forming a loop). The two endpoints can be the same spot or different spots.
  2. The curve must NOT cross any existing line or pass through any spot This is the fundamental constraint of Sprouts. Your new curve must navigate around all previously drawn lines without touching or crossing them, and it must not pass through any existing spot (it may only start and end at spots).
  3. Place a NEW spot somewhere on the curve you just drew After drawing your curve, mark a new spot at any point along it. This new spot splits your curve into two segments. The new spot is immediately “alive” and can be used in future turns — but it already has 2 of its 3 available connections used (one for each segment of the curve it sits on), so it has only 1 remaining connection.
  4. A spot is “dead” when it has 3 lines touching it Every spot — whether it was one of the original starting spots or a spot created during play — can have a maximum of 3 connections (3 line endpoints touching it). Once a spot reaches 3 connections, it is called saturated or “dead” and cannot be used as an endpoint for any future curve. It is helpful to mark dead spots with a small cross or circle them to keep track.
  5. The player who makes the LAST legal move WINS The game ends when no legal move can be made — that is, when it is impossible to draw any curve between two living spots without crossing an existing line. Under the normal play convention (the standard rule), the player who made the last successful move is the winner. The player who is unable to move on their turn loses.

Key Rules Summary

The Four Unbreakable Rules of Sprouts
  • No line may cross another line. Every curve must find a path through open space on the paper.
  • No line may pass through a spot. Curves can only start and end at spots, never pass through them.
  • A spot with 3 connections is saturated. It is permanently dead and cannot be used as an endpoint for any future curve.
  • New spots start with 2 connections used. When you place a spot on a curve, the two halves of that curve each count as one connection, leaving the new spot with only 1 remaining connection.

Game Length and Mathematical Properties

One of the most beautiful aspects of Sprouts is that its game length is bounded by a precise mathematical formula. For a game that begins with n starting spots:

The proof relies on counting the total number of available connections. At the start, there are n spots, each with 3 available connections, giving a total of 3n connection points. Each move uses exactly 2 connections (one at each endpoint of the curve) and creates 1 new spot with 1 available connection. So each move reduces the total number of available connections by exactly 1. The game ends when no two available connections can be joined by a non-crossing curve, which must happen before the available connections reach zero.

For the standard 3-spot game, this means:

This tight range is part of what makes 3-spot Sprouts such a well-balanced game. It is long enough for strategic depth but short enough to play quickly — most games finish in 5 to 15 minutes including thinking time.

Strategy

Sprouts strategy is far deeper than the simple rules suggest. Here are the key concepts that separate experienced players from beginners:

Understanding Regions

As curves are drawn on the paper, they divide the playing area into distinct regions — enclosed areas bounded by existing lines and the edge of the paper. Each region is essentially an independent sub-game. Living spots inside a region can only connect to other spots inside that same region (since a curve cannot cross the boundary lines). Counting the available moves within each region is the foundation of all Sprouts strategy.

Controlling the Number of Remaining Moves

Because the winner is the player who makes the last move, the total number of remaining moves determines who wins. If it is your turn and there is an odd number of moves left, you are in a winning position (assuming perfect play). If there is an even number, your opponent holds the advantage. The key strategic skill is making moves that adjust the parity (odd/even nature) of the remaining game in your favour.

Grundy Values and Combinatorial Game Theory

For serious players, Sprouts can be analysed using the Sprague-Grundy theorem from combinatorial game theory. Each Sprouts position has a Grundy value (also called a nim-value), and the Grundy value of a combined position is the nim-sum (XOR) of the Grundy values of its independent regions. When the Grundy value of the entire position is 0, the position is losing for the player whose turn it is; when it is non-zero, the position is winning. In practice, calculating Grundy values over the board is extremely difficult, but understanding the concept helps build intuition.

Practical Tips

Strategy Tips for Beginners
  • Count the living spots. Before each move, count how many spots still have available connections. This tells you roughly how many moves remain.
  • Think about parity. Try to leave an odd number of remaining moves for your opponent (so you get the last one).
  • Create small regions. Drawing curves that enclose a small area with few or no living spots inside can limit your opponent’s options.
  • Avoid saturating spots too quickly. Keeping spots alive gives you more flexibility on future turns.
  • Use loops strategically. A loop from a spot back to itself uses 2 of that spot’s 3 connections, which can be a powerful way to reduce available moves rapidly.

Computer Analysis

Complete computer analysis of Sprouts has been carried out for games starting with small numbers of spots. The results reveal a pattern (though it has not yet been proven to hold for all n):

Starting Spots (n) Winner Move Range
1 Second player 2–2 moves
2 Second player 4–5 moves
3 First player 6–8 moves
4 First player 8–11 moves
5 First player 10–14 moves
6 Second player 12–17 moves

The pattern appears to follow a cycle of period 6: second player wins for n = 0, 1, 2 (mod 6), and first player wins for n = 3, 4, 5 (mod 6). This conjecture has been verified by computer for all values up to around n = 44, but a formal proof remains elusive.

Visual Example: A 3-Spot Game

Here is a walk-through of a complete 3-spot game, showing how the board evolves over several moves. The spots are labelled A, B, and C for clarity.

Starting Position

A B C (3 spots, each with 0 connections — 9 available connections total)

Move 1 — Player 1 connects A to B, places spot D

A -----D----- B C A: 1 connection | B: 1 connection | C: 0 connections | D: 2 connections (7 available connections remain)

Move 2 — Player 2 connects D to C, places spot E

A -----D----- B \ E \ C A: 1 | B: 1 | C: 1 | D: 3 (DEAD) | E: 2 (5 available connections remain)

Move 3 — Player 1 connects A to C (curving around), places spot F

A -----D----- B | \ F E | \ +---------- C A: 2 | B: 1 | C: 2 | D: 3 (DEAD) | E: 2 | F: 2 (4 available connections remain)

The game continues with players carefully navigating the increasingly crowded board. Each new curve must thread through the gaps between existing lines without crossing any of them. After 6 to 8 total moves, no more legal curves can be drawn, and the player who made the last legal move wins.

Variants

Sprouts has inspired several variants, each with its own twist on the original rules:

Misère Sprouts

In Misère Sprouts, the rules are identical to normal Sprouts with one critical difference: the player who makes the last move loses instead of winning. This reversal of the winning condition fundamentally changes the strategy. Players must now try to force their opponent into making the final move. Positions that are winning in normal Sprouts may be losing in Misère, and vice versa. Misère Sprouts has also been analysed by computer, and the results show a different pattern of first-player and second-player wins compared to the normal version.

Brussels Sprouts

Brussels Sprouts was invented by John Conway as a humorous companion to Sprouts. Instead of dots, the game starts with crosses (+). Each cross has 4 arms, and each arm counts as one available connection point (rather than 3 per spot in normal Sprouts). When a player draws a curve, it must connect two free arms, and a new cross (with a bar across the curve) is placed on the line, creating 2 new free arms.

Despite looking like a strategic game, Brussels Sprouts is actually a predetermined game: starting with n crosses, the game always lasts exactly 5n − 2 moves, regardless of how the players play. This means the winner is entirely determined by whether 5n − 2 is odd or even. With 2 starting crosses, the game lasts 8 moves and the second player wins. Conway reportedly delighted in challenging unsuspecting opponents to Brussels Sprouts, knowing the outcome before the first move was made.

Star Sprouts

In Star Sprouts, players begin with different starting configurations instead of simple isolated dots. Starting points might include spots that are already connected by lines, creating pre-existing regions from the very first move. This variant allows for more varied opening positions and can be used to explore how different graph structures affect gameplay.

Sprouts on Surfaces

For the truly mathematically adventurous, Sprouts can be played on surfaces other than a flat sheet of paper. Playing on a torus (the surface of a doughnut, which can be simulated on paper by treating the top and bottom edges as connected, and the left and right edges as connected) changes the game dramatically because curves have more room to manoeuvre without crossing each other. Sprouts on a Klein bottle or a projective plane introduces even stranger topological possibilities.

The Conway and Paterson Story

The invention of Sprouts is one of the most charming stories in recreational mathematics. In February 1967, John Horton Conway was a young fellow at Gonville and Caius College, Cambridge, already gaining a reputation as one of the most creative mathematicians of his generation. Michael Stewart Paterson was a graduate student in the same department. The two were drinking tea and discussing mathematical games — a lifelong passion for Conway — when they began sketching dots and lines on paper.

The rules of Sprouts emerged quickly, almost fully formed. Conway later recalled that within hours of inventing the game, the entire department was playing it. Papers were covered with tangled webs of Sprouts positions. Lectures were disrupted. The game spread across Cambridge like wildfire. Conway described the invention as one of his happiest mathematical moments — the thrill of discovering something genuinely new that was simultaneously simple, beautiful, and deep.

Conway went on to become one of the most celebrated mathematicians of the 20th century, famous for the Game of Life (a cellular automaton), surreal numbers, the Monstrous Moonshine conjecture, and dozens of other contributions. He always maintained a special affection for Sprouts, frequently playing it with colleagues and students. He passed away in April 2020, but the games he invented — Sprouts among them — continue to delight new generations.

Paterson, who went on to a distinguished career in theoretical computer science at the University of Warwick, has described the invention of Sprouts as a moment of pure collaborative serendipity — two minds playing with an idea until something wonderful emerged.

Why Mathematicians Love Sprouts

Sprouts occupies a special place in mathematics for several reasons:

Martin Gardner, the legendary recreational mathematics columnist for Scientific American, featured Sprouts in his July 1967 column, just months after its invention. Gardner’s article introduced the game to a worldwide audience and cemented its place in the pantheon of great mathematical games. He wrote that Sprouts was “the most significant new pencil-and-paper game in some time,” a verdict that has only been strengthened by the decades of mathematical research the game has inspired.


Play Sprouts Online

Our interactive browser version is coming soon! Play against a friend right on this page.


Frequently Asked Questions

Sprouts was invented on 21 February 1967 by mathematicians John Horton Conway and Michael S. Paterson during a tea break at the Department of Pure Mathematics and Mathematical Statistics at Cambridge University, England.

A game of Sprouts starting with n spots always lasts between 2n and 3n−1 moves. For the standard 3-spot game, this means the game lasts between 6 and 8 moves. The game is mathematically guaranteed to terminate.

On each turn a player draws a curve connecting two spots (or looping from one spot back to itself), then places a new spot on that curve. No line may cross another line or pass through a spot. A spot with 3 connections is dead and cannot be used. The player who makes the last legal move wins.

Sprouts is designed as a two-player game, but it is also valuable as a solo puzzle. You can analyse positions, work out which player has a winning strategy for a given number of starting spots, or simply explore the branching tree of possible games to sharpen your graph theory intuition.

Misère Sprouts uses exactly the same rules as normal Sprouts, but the winning condition is reversed: the player who makes the last move loses rather than wins. This small change significantly alters the strategy because players try to force their opponent into making the final move.

Brussels Sprouts is a variant invented by John Conway in which players start with crosses (+) instead of dots. Each arm of a cross counts as one connection, so each cross starts with 4 available connections. Despite appearing strategic, Brussels Sprouts is actually a predetermined game: it always lasts exactly 5n−2 moves (where n is the number of starting crosses), so the winner is determined entirely by n and who goes first.

Sprouts has been solved by computer for small numbers of starting spots. As of the latest research, games with up to around 44 starting spots have been completely analysed. For small games (1–7 spots), the first player wins when the number of spots is 3, 4, or 5, and the second player wins with 1, 2, or 6 spots. A general formula for all values of n has not yet been proven.

Every Sprouts position can be represented as a planar graph, where spots are vertices and curves are edges. The constraint that no line may cross another enforces planarity, and the 3-connection limit on each spot corresponds to a maximum vertex degree of 3. Euler’s formula for planar graphs is the basis of the proof that every Sprouts game must terminate.