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

Home > Games
Save our souls (Posted on 2016-06-03) Difficulty: 3 of 5
Imagine a row of 2000 squares. Two players in turn write either an S or an O in an empty square.
The first player who produces three consecutive boxes that spell SOS wins.
If all boxes are filled without producing SOS then the game is a draw.

Prove that the second player has a winning strategy.

Source: (USAMO ’99)

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
No Subject | Comment 1 of 2
The Usamo 99 gives this formulation, which is sligthly different, because if there is a S,O,S the last player wins.

Two players play a game on a line of 2000 squares. Each player in turn puts either S or O into an empty square. The game stops when three adjacent squares contain S, O, S in that order and the last player wins. If all the squares are filled without getting S, O, S, then the game is drawn. Show that the second player can always win.
  Posted by armando on 2016-06-03 16:42:20
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information