Multiples, not arbitrary amounts
If the values are a and b with a no larger than b, a legal move replaces b with b − ka for an integer k of at least one. The chosen multiple may make the new value zero, which wins immediately.
Make one of the two values zero by choosing legal multiples on alternating turns.
Your unfinished game is saved only in this browser.
Make one of the two values zero by choosing legal multiples on alternating turns.
Complete guide
Euclid's Game turns the subtraction step of the Euclidean algorithm into a two-player contest. On each move, subtract a positive multiple of the smaller value from the larger without making it negative.
If the values are a and b with a no larger than b, a legal move replaces b with b − ka for an integer k of at least one. The chosen multiple may make the new value zero, which wins immediately.
The integer quotient of the larger value divided by the smaller is the largest legal multiple. A large quotient offers several choices; a quotient of one forces a single subtraction.
Always choosing the largest multiple reaches zero when it is available, but otherwise may hand the opponent a favorable ratio. Compare the resulting pair after each candidate multiple instead of treating the game as automatic arithmetic.
Positions near the golden ratio often force a chain of quotient-one moves. When the quotient is at least two, the current player frequently has more control over which side of that boundary the next pair occupies.
No. The amount must be a positive whole-number multiple of the smaller current value.
The player who made that move wins immediately.
Yes. The interface presents the resulting pair from smaller to larger so the next legal multiples are clear.