You are given just three eggs, and access to a 100-storey building. All 3 eggs are identical.
The aim is to find out the highest floor from which an egg will not break when dropped out of a window from that floor. If an egg is dropped and does not break, it is undamaged and can be dropped again. However, once an egg is broken, that’s it for that egg.
If an egg breaks when dropped from floor n, then it would also have broken from any floor above that. If an egg survives a fall, then it will survive any fall shorter than that.
Adopting best strategy what is the absolute minimum number of egg drops you need to reach the solution given any and every possible scenario?
Details and Assumptions:
by
Satyen Nabar
