Zwick, Uri and Paterson, Michael S. (1993) The memory game. Theoretical Computer Science, Volume 110 (Number 1). pp. 169-196. doi:10.1016/0304-3975(93)90355-W ISSN 0304-3975.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

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
Alternative Title:
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title:	Theoretical Computer Science
Publisher:	Elsevier Science BV
ISSN:	0304-3975
Official Date:	15 March 1993
Dates:	Date Event 15 March 1993 Published
Volume:	Volume 110
Number:	Number 1
Number of Pages:	28
Page Range:	pp. 169-196
DOI:	10.1016/0304-3975(93)90355-W
Status:	Peer Reviewed
Publication Status:	Published

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item