Two eggs any style -- generalizing egg-drop experiments
From MaRDI portal
Publication:6408326
arXiv2208.09576MaRDI QIDQ6408326FDOQ6408326
Authors: Harold Parks, Dean C. Wills 
Publication date: 19 August 2022
Abstract: The egg-drop experiment introduced by Konhauser, Velleman, and Wagon, later generalized by Boardman, is further generalized to two additional types. The three separate types of egg-drop experiment under consideration are examined in the context of binary decision trees. It is shown that all three types of egg-drop experiment are binary decision problems that can be solved efficiently using a non-redundant algorithm -- a class of algorithms introduced here. The preceding theoretical results are applied to the three types of egg-drop experiment to compute, for each, the maximum height of a building that can be dealt with using a given number of egg-droppings.
This page was built for publication: Two eggs any style -- generalizing egg-drop experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408326)
