You are not currently logged in.

Access JSTOR through your library or other institution:


Log in through your institution.

Journal Article

The Tower and Glass Marbles Problem

Richard T. Denman, David Hailey and Michael Rothenberg
The College Mathematics Journal
Vol. 41, No. 5 (November 2010), pp. 350-356
DOI: 10.4169/074683410x521946
Stable URL:
Page Count: 7
  • Download ($16.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
The Tower and Glass Marbles Problem
Preview not available


Abstract The Catseye Marble company tests the strength of its marbles by dropping them from various levels of their office tower, to find the highest floor from which a marble will not break. We find the smallest number of drops required and from which floor each drop should be made. We also find out how these answers change if a restriction is placed on the number of marbles allocated for testing. Investigating this puzzle motivates algorithmic thinking, and leads to an interesting recursive solution.

Page Thumbnails