29 Jul
2003
29 Jul
'03
11:54 a.m.
Let there be n buttons. A player may take 1 or 2 buttons MORE than his/her opponent took. Player 1 can take either 1 or 2 buttons. e.g. 28->27->25->21->15->7->0 (the last player must take either 8 or 9, as only 7 remain, they must take them all). What are the strategies for various n, with either last button wins/loses? Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com