Strong convergence and the polygon property of 1-player games Original Research Article

A one-player game is strongly convergent if the length of the game and the terminal position depends only on the starting position. We present several examples (the chips game, bubble-sort, extendable shelling, the chromatic polynomial, the k-core, jeu-de-tacquin) of how strong convergence can be shown using a technique of finding a ·polygon’, a local convergence property.