Optimal token allocation in solitaire knock'm down
type: Item
instance of: scholarly article
title: Optimal token allocation in solitaire knock'm down
zbMATH Open document ID: 0997.91012
author: Arthur T. Benjamin
author: Matthew T. Fluet
author: Mark Huber
published in: The Electronic Journal of Combinatorics
publication date: 2001-10-16T00:00:00Z
full work available at URL: https://eudml.org/doc/122153
full work available at URL: v8i2r2.html
review text: 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.
reviewed by: Vasile Postolică
Mathematics Subject Classification ID: 91A60
zbMATH DE Number: 1638980
MaRDI profile type: MaRDI publication profile
Recommended article: The Algorithmics of Solitaire-Like Games
Recommended article: Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game
Recommended article: Let’s Get Rolling! Exact Optimal Solitaire Yahtzee
Recommended article: Q3013479
Recommended article: Solitaire clobber
Recommended article: The Complexity of Solitaire
Recommended article: The complexity of solitaire
Recommended article: Solitaire Clobber on circulant graphs
Recommended article: Q2949114
description: scientific article; zbMATH DE number 1638980