Optimal token allocation in solitaire knock'm down
This paper is devoted to the study of the games knock'm down in the solitaire versions. The authors establish necessary conditions on the number of tokens needed for each bin in optimal solutions and the corresponding asymptotic solutions, which are important for the optimal strategies in knock'm down.
scientific article; zbMATH DE number 1638980