The memory game
type: Item
instance of: scholarly article
title: The memory game
zbMATH Open document ID: 0781.90099
DOI: 10.1016/0304-3975(93)90355-W
author: Uri Zwick
author: Michael S. Paterson
published in: Theoretical Computer Science
publication date: 1993-08-30T00:00:00Z
review text: The memory game, or concentration, as it is sometimes called, is a popular card game played by children and adults around the world. Good memory is one of the qualities required in order to succeed in it. This, however, is not enough. When it is assumed that the players have perfect memory, the memory game can be seen as a game of strategy. The game is analysed under this assumption and the optimal strategy is found. It is simple and perhaps unexpected. In contrast to the simplicity of the optimal strategy, the analysis leading to its optimality proof is rather involved. It supplies an interesting example of concrete mathematics of the sort used in the analysis of algorithms. It is doubtful whether this analysis could have been carried out without resort to experimentation and a substantial use of automated symbolic computations.
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 179581
zbMATH Keywords: memory game
zbMATH Keywords: concentration
zbMATH Keywords: card game
zbMATH Keywords: automated symbolic computations
Wikidata QID: Q56638788
MaRDI profile type: Publication
cites work: Q4040797
full work available at URL: 0304-3975(93)90355-w
OpenAlex ID: W1975905833
DBLP publication ID: journals/tcs/ZwickP93
description: scientific article; zbMATH DE number 179581