Math @ Duke

Publications [#10384] of Mark Huber
Papers Published
 A. Benjamin, M. Huber, M. Fluet, Optimal Token Allocations in Solitaire Knock 'm Down,
The Electronic Journal of Combinatorics, vol. 8 no. 2
(2001),
pp. 18
(last updated on 2007/08/08)
Abstract: In the game Knock 'm Down, tokens are placed in N bins.
At each step of the game, a bin is chosen at random
according to a fixed probability distribution. If a token
remains in that bin, it is removed. When all the token
have been removed, the player is done. In the solitaire
version of this game, the goal is to minimize the expected
number of moves needed to remove all the tokens. Here we
present necessary conditions on the number of tokens
needed for each bin in an optimal solution, leading to an
asymptotic solution.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

