4 added 19 characters in body

Sprouts is a game contrived by J. H. Conway and M. S. Paterson in the 1960s.

It is an impartial game with for two players played on the a plane with some spots. Each move consists of both

1. joining two spots (could be the same spot) with a simple curve which does not go through existing spots or curves, such that the degree of each spot after the move does not exceed 3; and
2. placing a new spot on that curve.

The winner/loser is who

Who makes the last move is the winner/loser according to normal/misère play convention.

This game is of topological nature but there are only finitely many inequivalent options at each move, and the game always terminates after finitely many moves (in fact, bounded by number of initial spots), making it an combinatorial game.

It enjoys some popularity, as reflected by the existence of a world association (the WGOSA, World Game of Sprouts Association).

There are rich graph-theoretic results concerning this game, for example see this page in NRICH and this section in Winning Ways. Experienced players make use of these results to set up goals.

Here is a website dedicated to the determination of the theoretical winnerwinners. A pattern with period 6 emerged under both play conventions. The researchers have published several papers and even considered Sprouts on general surfaces ("compact" is not essential, I think), and proved that the theoretical winner of the Sprouts game with a fixed number of spots on different compact surfaces is ultimately periodic in genus, with period 1/period 2 in the case of orientable/non-orientable surfaces.

3 added 37 characters in body

Sprouts is a game contrived by J. H. Conway and M. S. Paterson in the 1960s.

It is an impartial game with two players played on the plane with some spots. Each move consists of

1. connecting both

1. joining two spots (could be the same spot) with a simple curve which does not go through other existing spots or curves, such that the degree of each spot after the move does not exceed 3; and
2. placing a new spot on that curveminus its endpoints.

The winner winner/loser is who makes / does not make the last move according to normal / misère normal/misère play convention.

This game is of topological nature but there are only finitely many inequivalent options at each move, and the game always terminates after finitely many moves (in fact, bounded by number of initial spots), making it an combinatorial game.

It enjoys some popularity, as reflected by a world association (the WGOSA, World Game of Sprouts Association).

There are quite a lot of rich graph-theoretic results concerning this game, for example see this page in NRICH and this section in Winning Ways. Experienced players make use of these results to set up goals.

Here is a website dedicated to determination of the theoretical winnerunder perfect play. A pattern with period 6 emerged under both play conventions. They've The researchers have published several papers and even considered Sprouts on general surfaces ("compact" is not essential, I think), and proved that the theoretical winner of the Sprouts game with same a fixed number of spots on different compact surfaces of increasing genus is ultimately stable (or periodic in genus, with period 1/period 2 in the case of non-orientable surface)orientable/non-orientable surfaces.

2 added 21 characters in body

Sprouts is a game contrived by J. H. Conway and M. S. Paterson in the 1960s.

It is an impartial game with two players played on the plane with some spots. Each move consists of

1. connecting two spots (could be the same spot) with a simple curve which does not go through other spots or curves, such that the degree of each spot does not exceed 3; and
2. placing a new spot on that curve minus its endpoints.

The winner is who makes / does not make the last move according to normal / misère play convention.

This game is of topological nature but there are only finitely many inequivalent options at each move, and the game always terminates after finitely many moves (in fact, bounded by number of initial spots), making it an combinatorial game.

It enjoys some popularity, as reflected by a world association (the WGOSA (, World Game of Sprouts Association).

There are quite a lot of graph-theoretic results concerning this game, for example see this page in NRICH and this section in Winning Ways. Experienced players make use of these results to set up goals.

Here is a website dedicated to determination of the winner under perfect play. A pattern with period 6 emerged under both play conventions. They've published several papers and even considered Sprouts on general surfaces ("compact" is not essential, I think), and proved that the winner of the Sprouts game with same spots on surfaces of increasing genus is ultimately stable (or periodic, in the case of non-orientable surface).