The Beans Game

[From the notes of Emily Moore with modifications by Samuel A. Rebelsky.]

We start with 17 beans in a pile. Two players alternate, each removing 1, 2, 3, or 4 beans in a turn. The player who removes the last bean wins. What strategy should the first player use to guarantee that (s)he will win? Will this strategy work for other size piles? Are there any size piles for which the second player has a winning strategy?


[Front Door] [Problems] [Resolutions] [Essays] [Resources] [Miscellaneous]

Warning! This site is under development.

Source text last modified Tue May 5 08:49:52 1998.

This page generated on Thu May 7 14:25:00 1998 by SiteWeaver.

Contact our webmaster at rebelsky@math.grin.edu