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

 Memory Match Game (Posted on 2017-05-31)
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?

 Submitted by Steve Herman No Rating Solution: (Hide) Assume 2n cards. Because you have perfect memory, you might as well turn all the cards over 2 at a time, which takes n turns, and then remove all the matches, which takes another n turns. However, the game may take less than 2n turns, because of immediate matches, which do not need to be removed in the 2nd n turns, as they are removed during the first n turns at the time of the initial exposure. On any one of the n initial turns, the probability of an immediate match is 1/(2n-1). The expected number of immediate matches is therefore n/(2n-1). The total number of expected turns is therefore 2n - n/(2n-1). If there are 10 cards, then the expected number of turns is 10 - 5/9 = 9 + 4/9

 Subject Author Date Analytical Solution is posted Steve Herman 2017-06-03 07:52:03 re: Question Steve Herman 2017-06-02 11:01:13 re: Question Charlie 2017-06-02 04:57:16 Question hoodat 2017-06-01 19:46:32 re(3): computer discovery Charlie 2017-06-01 10:32:45 re(2): computer discovery Steve Herman 2017-06-01 09:17:00 re(2): computer discovery Charlie 2017-06-01 08:58:32 re: computer discovery Jer 2017-05-31 21:18:03 computer discovery Charlie 2017-05-31 16:20:20

 Search: Search body:
Forums (0)