John & Peter's Chessboard Game: Minimal Moves for Victory

  • Context: MHB 
  • Thread starter Thread starter Evgeny.Makarov
  • Start date Start date
  • Tags Tags
    Game
Click For Summary
SUMMARY

In the chessboard game between John and Peter, John selects 8 squares on an 8x8 chessboard, ensuring no two squares share the same row or column. Peter must place 8 rooks on the board, avoiding attacks on each other. Peter wins if the number of rooks on John's chosen squares is even. The minimal number of moves required for Peter to guarantee a victory is 1, as he can strategically place the rooks to ensure an even count on John's squares.

PREREQUISITES
  • Understanding of chessboard configurations
  • Knowledge of rook movement and placement in chess
  • Familiarity with combinatorial game theory
  • Basic principles of parity in mathematics
NEXT STEPS
  • Study chess strategies involving rook placements
  • Explore combinatorial game theory applications
  • Learn about parity and its implications in game theory
  • Investigate similar games involving strategic placement and victory conditions
USEFUL FOR

Game theorists, chess enthusiasts, mathematicians, and anyone interested in strategic problem-solving in competitive environments.

Evgeny.Makarov
Gold Member
MHB
Messages
2,434
Reaction score
4
John and Peter play the following game using a regular chessboard. John thinks of 8 squares so that no two squares lie in the same row or in the same column. During each move Peter puts 8 rooks on the board so that they don't attack each other, and John points out all rooks that are located on the squares he has chosen. If the number of rooks pointed out by John during this move is even (i.e., 0, 2, 4, 6 or 8), then Peter wins; otherwise all pieces are taken off the board and Peter makes the next move. What minimal number of moves are necessary for Peter to have a guaranteed victory?

Note: John thinks of 8 squares only once per game.
 
Mathematics news on Phys.org
Evgeny.Makarov said:
John and Peter play the following game using a regular chessboard. John thinks of 8 squares so that no two squares lie in the same row or in the same column. During each move Peter puts 8 rooks on the board so that they don't attack each other, and John points out all rooks that are located on the squares he has chosen. If the number of rooks pointed out by John during this move is even (i.e., 0, 2, 4, 6 or 8), then Peter wins; otherwise all pieces are taken off the board and Peter makes the next move. What minimal number of moves are necessary for Peter to have a guaranteed victory?

Note: John thinks of 8 squares only once per game.

Please post the solution you have ready.
 

Similar threads

Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 18 ·
Replies
18
Views
7K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 83 ·
3
Replies
83
Views
22K
  • · Replies 5 ·
Replies
5
Views
2K