The memory game
Zwick, Uri, 1961- and Paterson, Michael S.. (1993) The memory game. Theoretical Computer Science, Volume 110 (Number 1). pp. 169-196. ISSN 0304-3975Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/0304-3975(93)90355-W
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.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||Theoretical Computer Science|
|Publisher:||Elsevier Science BV|
|Official Date:||15 March 1993|
|Number of Pages:||28|
|Page Range:||pp. 169-196|
Actions (login required)
Downloads per month over past year