Author |
Topic: Winning strategy? (Read 410 times) |
|
wonderful
Full Member
Posts: 203
|
 |
Winning strategy?
« on: Jul 8th, 2008, 4:45pm » |
 Quote  Modify
|
Given a chessboard 5 x 5 , two people play a game by in turn marking a number in an empty cell. Person 1 always marks number 1, whereas person 2 always marks number 0. Each time, each person is allowed to mark 1 number until there is no empty cell. Person 1 marks first.
As the game finished, a referee will sum all number in cells that make a square of 3x3. Note that there are a number of 3x3 squares in the original 5x5 chessboard. Let A be the greatest number among these sums.
What is the maximal value of A that person 1 can make regradless of person 2 strategy? How person 1 can achieve this sum?
Have A Great Day!
|
| « Last Edit: Jul 8th, 2008, 5:42pm by wonderful » |
 IP Logged |
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print