Java Program for Egg Dropping Puzzle | DP-11 - GeeksforGeeks

22 Feb, 2022
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 the total number of trials are minimized.
Source: Wiki for Dynamic Programming
Dynamic Programming Solution
Java
// A Dynamic Programming based Java Program for the Egg Dropping Puzzleclass EggDrop {    // A utility function to get maximum of two integers    static int max(int a, int b) { return (a > b) ? a : b; }     /* Function to get minimum number of trials needed in worst    case with n eggs and k floors */    static int eggDrop(int n, int k)    {        /* A 2D table where entry eggFloor[i][j] will represent minimum       number of trials needed for i eggs and j floors. */        int eggFloor[][] = new int[n + 1][k + 1];        int res;        int i, j, x;         // We need one trial for one floor and0 trials for 0 floors        for (i = 1; i <= n; i++) {            eggFloor[i][1] = 1;            eggFloor[i][0] = 0;        }         // We always need j trials for one egg and j floors.        for (j = 1; j <= k; j++)            eggFloor[1][j] = j;         // Fill rest of the entries in table using optimal substructure        // property        for (i = 2; i <= n; i++) {            for (j = 2; j <= k; j++) {                eggFloor[i][j] = Integer.MAX_VALUE;                for (x = 1; x <= j; x++) {                    res = 1 + max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);                    if (res < eggFloor[i][j])                        eggFloor[i][j] = res;                }            }        }         // eggFloor[n][k] holds the result        return eggFloor[n][k];    }     /* Driver program to test to printDups*/    public static void main(String args[])    {        int n = 2, k = 10;        System.out.println("Minimum number of trials in "+                           "worst case with "                           + n + "  eggs and " + k + " floors is " + eggDrop(n, k));    }}/*This code is contributed by Rajat Mishra*/
Minimum number of trials in worst case with 2  eggs and 10 floors is 4
 
Please refer complete article on Egg Dropping Puzzle | DP-11 for more details! 
sweetyty
kashishsoda
simmytarika5
Java Programs
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Iterate Over the Characters of a String in Java
How to Get Elements By Index from HashSet in Java?
Java Program to Write into a File
Java Program to Read a File to String
How to Replace a Element in Java ArrayList?
Java Program to Find Sum of Array Elements
How to Write Data into Excel Sheet using Java?
Removing last element from ArrayList in Java
Tic-Tac-Toe Game in Java
Java Program to Write an Array of Strings to the Output Console