LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Zwick, Uri; Paterson, Michael S.
Publisher: University of Warwick. Department of Computer Science
Journal: Theoretical Computer Science
Languages: English
Types: Article
Subjects: QA, Theoretical Computer Science, Computer Science(all)

Classified by OpenAIRE into

ACM Ref: ComputingMilieux_PERSONALCOMPUTING
The memory game 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. This 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 substantial use of automated symbolic computation.
  • No references.
  • No related research data.
  • No similar publications.