Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Terms of use
Privacy Policy

More Mathematics
CTK Exchange

Games to Relax
Guest book
Recommend this site

Sites for teachers
Sites for parents

Manifesto: what CTK is about Buying a book is a commitment to learning Things you can find on CTK Email to Cut The Knot Recommend this page

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.

<hr> <h3> This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet. </h3> <hr>

Strategy

Copyright © 1996-2008 Alexander Bogomolny



Search:
Keywords: