# Another Sticky Problem

The game presented by a Java applet below was published in 2004 the *Mathematics Magazine* as problem #1687 (Sung Soo Kim). A solution by Li Zhou appeared in v. 78, n. 1 (February, 2005), p. 70.

A two-player game starts with two sticks, one of length N and one of length N+1, where n is a positive integer. Players alternate turns. A turn consists of breaking a stick into two sticks of positive integer lengths, or removing k sticks of length k for some positive integer k. The player who makes the last move wins. Which player can force a win, and how?

The applet allows for experimentation with different starting lengths. At the outset, you can force the computer to make the first move by pressing the "Make move" button. Sticks are represented by a row of small squares that might remind of a chocolate brick. To break a piece click on a square to the right of the desired break line.

What if applet does not run? |

|Contact| |Front page| |Contents| |Store|

Copyright © 1996-2017 Alexander Bogomolny

Let A be the set of positions with an even number of sticks and at most one stick of even length. Let B be the set of game positions with an odd number of sticks and at most two sticks of even length. Note that the initial and final game positions are in A. It is also evident that any move from an A-position results in a B-position and that from each B-position a move can be made that results in an A-position. Thus the second player can force a win by always making a move that puts the game into an A-position.

Copyright © 1996-2017 Alexander Bogomolny

62038499 |