Variations of the Game 3-Euclid

Abstract EN

We present two variations of the game 3-Euclid.

The games involve a triplet of positive integers.

Two players move alternately.

In the first game, each move is to subtract a positive integer multiple of the smallest integer from one of the other integers as long as the result remains positive.

In the second game, each move is to subtract a positive integer multiple of the smallest integer from the largest integer as long as the result remains positive.

The player who makes the last move wins.

We show that the two games have the same P-positions and positions of Sprague-Grundy value 1.

We present three theorems on the periodicity of P-positions and positions of Sprague-Grundy value 1.

We also obtain a theorem on the partition of Sprague-Grundy values for each game.

In addition, we examine the misère versions of the two games and show that the Sprague-Grundy functions of each game and its misère version differ slightly.