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

Home > Games
No Repeats (Posted on 2006-09-13) Difficulty: 4 of 5
Andrew and Betty play a game in which they lay out a row of three coins, heads up. They take turns, begining with Andrew, turning over one of the coins at a time. They must not produce a pattern of heads and tails which has already occurred earlier in the game. The first person who cannot make a move is the loser.

1. If they each play as well as possible, who is the winner?

2. If the game were played with four coins instead of three, who would be the winner?

3. If the game is played with three coins but the player who cannot make a move is declared the winner, who wins now?

See The Solution Submitted by Charlie    
Rating: 4.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
It's obvious | Comment 5 of 7 |
The problem is purely binary, whoever makes the first move, wins, regardless of the number of coins.

  Posted by Kit on 2006-09-17 12:23:34
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 (15)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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