The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors.
Suppose that we wish to know which stories in a 36-story building are safe to drop eggs from, and which will cause the eggs to break on landing. We make a few assumptions:
…..An egg that survives a fall can be used again.
…..A broken egg must be discarded.
…..The effect of a fall is the same for all eggs.
…..If an egg breaks when dropped, then it would break if dropped from a higher floor.
…..If an egg survives a fall then it would survive a shorter fall.
…..It is not ruled out that the first-floor windows break eggs, nor is it ruled out that the 36th-floor do not cause an egg to break.
If only one egg is available and we wish to be sure of obtaining the right result, the experiment can be carried out in only one way. Drop the egg from the first-floor window; if it survives, drop it from the second floor window. Continue upward until it breaks. In the worst case, this method may require 36 droppings. Suppose 2 eggs are available. What is the least number of egg-droppings that is guaranteed to work in all cases?
The problem is not actually to find the critical floor, but merely to decide floors from which eggs should be dropped so that total number of trials are minimized.
Source: Wiki for Dynamic Programming
Dynamic Programming Solution
Minimum number of trials in worst case with 2 eggs and 36 floors is 8
Please refer complete article on Egg Dropping Puzzle | DP-11 for more details!
- Program to remove empty array elements in PHP
- Program to Insert new item in array on any position in PHP
- PHP Program for Naive algorithm for Pattern Searching
- PHP Program for Rabin-Karp Algorithm for Pattern Searching
- PHP Program to print all permutations of a given string
- PHP Program for Median of two sorted arrays of same size
- PHP Program for Subset Sum Problem | DP-25
- PHP Program for Largest Sum Contiguous Subarray
- PHP Program for Minimum number of jumps to reach end
- PHP Program for Cutting a Rod | DP-13
- PHP Program for Longest Palindromic Subsequence | DP-12
- PHP Program to Count set bits in an integer
- PHP Program to Find the Number Occurring Odd Number of Times
- PHP Program to Count number of binary strings without consecutive 1's
- PHP Program for Count ways to reach the n\'th stair
- PHP Program to Find the closest pair from two sorted arrays
- PHP Program to Count trailing zeroes in factorial of a number
- PHP Program for nth Catalan Number
- PHP Program to find whether a no is power of two
- PHP program to Generate the random number in the given range (min, max)