Dynamic programming: Difference between revisions

Revision as of 18:37, 3 November 2019

Revision as of 14:53, 22 November 2019

Line 369:

=== Egg dropping puzzle ===

The following is a description of the instance of this famous [[puzzle]] involving N=2 eggs and a building with H=36 floors:<ref>Konhauser J.D.E., Velleman, D., and Wagon, S. (1996). [httphttps://wwwbooks.cambridgegoogle.orgby/uk/catalogue/catalogue.aspbooks?isbnid=ElSi5V5uS2MC&printsec=9780883853252frontcover&hl=ru#v=onepage&q&f=false Which way did the Bicycle Go?]{{Dead link|date=July 2019 |bot=InternetArchiveBot |fix-attempted=yes }} Dolciani Mathematical Expositions – No 18. [[The Mathematical Association of America]].</ref>

: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 (using [[U.S. English]] terminology, in which the first floor is at ground level). We make a few assumptions: