Number of Moves
It is not evident from the rules of Sprouts that the game always terminates, since the number of spots increase at each move. The correct approach is to consider the number of lives (opportunities to connect a line) instead of the number of spots. Then, we can show that if the game starts with n spots, it will end in no more than 3n−1 moves and no fewer than 2n moves.
In the following proofs, we suppose that a game starts with n spots and lasts for exactly m moves.
Read more about this topic: Sprouts (game)
Famous quotes containing the words number of, number and/or moves:
“God ... created a number of possibilities in case some of his prototypes failed—that is the meaning of evolution.”
—Graham Greene (1904–1991)
“Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.”
—Noam Chomsky (b. 1928)
“They wait, each like a wooden decoy
or soft like a pigeon or
a sweet snug duck:
until one moves, moves that dart-beak
breaking over.”
—Anne Sexton (1928–1974)