I have a partially played game of sprouts that I need help solving. The rules are simple (Kevin over at VSauce2 did a great job explaining it if you don't like reading, though the Yoda voice is a bit over the top):

  • Each player takes turns drawing a line from one dot to another.
    • After drawing a line, a new dot is placed anywhere on the line so long as it doesn't intersect with any other dot.
  • A dot can not intersect with more than three lines.
    • A dot with three intersecting lines is considered dead.
  • Lines can:
    • Be straight.
    • Can curve.
    • Can form complete circles back to the starting point.
    • Can never intersect other lines.

The object of the game is to force your opponent into having no playable moves remaining. This is accomplished when all dots are either dead or unplayable based on the rules above. For example with a two dot starting point and red starts, and red wins:

Start Start + 1 Start + 2 Start + 3 Start + 4 Final

Now that you know how to play, I've found an old game of sprouts laying around and need help figuring out the best strategy to win. Red moves next.


If both players are making the most advantageous move for themselves:

  • What is the fewest number of moves possible to complete the game?
    • Who wins in this scenario?

This is a golf style puzzle meaning the answer with the fewest number of moves wins.


1 Answer 1


First, let's hand out names for living dots. The free-standing dot with no lines is A. The dot to the lower right is B, the other dot that can be reached from A is C, and the one dot that can only be reached from C is D

The remaining moves are either 2 or 4, depending on how they are made. If A connects to both B and C (2), that'll open up two more dots, which can connect to one another (3), creating a dot that can connect back to the one unfilled slot on A (4). (A slight variant occurs if A connects to either B or C, and then connects the resulting dot to the other one, but it still comes out at 4.) If D connects to C, that leaves only B to connect to A, leaving 2 connections made. Likewise, if B connects to C, only the newly generated dot can be connected to A, leaving two connections. Red wins, regardless of the strategy that either player might employ.

Or, in short

fewest moves: 2. Red wins.

  • $\begingroup$ I don't see how you can end the game in 2 moves. Besides, you don't consider the possibility of connecting A to itself. Blue can win if red is not careful. So the game can end in 3 or 4 moves, except that red can prevent 3 to happen and blue to win. $\endgroup$
    – Florian F
    Aug 23, 2022 at 8:08

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.