OR/MS Games: 4. The Joy of Egg-Dropping in Braunschweig and Hong Kong

Moshe Sniedovich - m.sniedovich@ms.unimelb.edu.au
Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3052, Australia

Abstract

In this discussion we examine the famous 2-egg puzzle from an OR/MS perspective and explore the structure of the optimal policies for this puzzle. It is shown that the puzzle provides a vivid environment for teaching/learning basic concepts related to decision making under uncertainty, including the differences and similarities between the Worst Case and Expected Value scenarios. The more general problem where N test eggs—rather than 2—are provided is also examined. A number of interactive modules for experimenting with and solving this interesting puzzle are provided. Lecturers teaching dynamic programming (DP) might be interested in using this puzzle to illustrate how DP works and how it can be used to derived closed-form solutions to discrete optimization problems. A reference is provided to a practical real world application of the mathematical model used to analyze and solve the game.

Download the PDF
10.1287/ited.4.1.48

Citation Information
Sniedovich, M. 2003. OR/MS Games: 4. The Joy of Egg-Dropping in Braunschweig and Hong Kong. INFORMS Trans. Ed. 4(1) 48-64. Available online at http://ite.pubs.informs.org/.

DOI: 10.1287/ited.4.1.48