All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Probability
Memory Match Game (Posted on 2017-05-31) Difficulty: 3 of 5
10 cards with identical backs are face down on a table. Each card face matches exactly one of the other card faces. The cards are in a random sequence. A turn consists of choosing 2 cards, simultaneously reversing them so that they are face up, discarding them if they match, and turning them face down if they do not match. The game ends when all cards are discarded.

a) If you have perfect memory, and an efficient strategy, then what is the expected number of turns in the 10 card game?

b) What is the expected number of turns if instead there are 2n cards in the starting tableaux, with each card matching exactly one other?

See The Solution Submitted by Steve Herman    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionAnalytical Solution is postedSteve Herman2017-06-03 07:52:03
re: QuestionSteve Herman2017-06-02 11:01:13
re: QuestionCharlie2017-06-02 04:57:16
QuestionQuestionhoodat2017-06-01 19:46:32
re(3): computer discoveryCharlie2017-06-01 10:32:45
re(2): computer discoverySteve Herman2017-06-01 09:17:00
re(2): computer discoveryCharlie2017-06-01 08:58:32
re: computer discoveryJer2017-05-31 21:18:03
Solutioncomputer discoveryCharlie2017-05-31 16:20:20
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information