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.