## 2 Eggs and 100 Story Building

A forum for good logic/math puzzles.

Moderators: jestingrabbit, Moderators General, Prelates

Trebla
Posts: 387
Joined: Fri Apr 02, 2010 1:51 pm UTC

### 2 Eggs and 100 Story Building

You have two eggs and a 100 story building. These eggs are identical and possibly much harder than normal eggs. Your goal is to determine the highest floor of the building they can be dropped from without breaking using the fewest test drops.

What is the optimal search algorithm? How many drops would it take using the algorithm in the worst case scenario?

NOTE: Once an egg breaks, it can not be used again for further test drops.
NOTE 2: This is an "inside the box" riddle, no tricks.

Azrael001
Posts: 2385
Joined: Sun Nov 11, 2007 5:15 am UTC
Location: The Land of Make Believe.
Contact:

### Re: 2 Eggs and 100 Story Building

My method has a minimum number of drops equal to two, and a maximum of 51.
Spoiler:
Start at floor two, drop an egg (assume that drops have no effect on structural integrety of egg) if it breaks, drop at floor one to see it it breaks there or not. If it doesn't break, go up two floors and repeat.
23111

jaap
Posts: 2094
Joined: Fri Jul 06, 2007 7:06 am UTC
Contact:

### Re: 2 Eggs and 100 Story Building

It's been done before:
viewtopic.php?f=3&t=199

Trebla
Posts: 387
Joined: Fri Apr 02, 2010 1:51 pm UTC

### Re: 2 Eggs and 100 Story Building

jaap wrote:It's been done before:
viewtopic.php?f=3&t=199

Thanks, search doesn't help when the terms you're searching for change :/