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

  • Thread starter Thread starter Evgeny.Makarov
  • Start date Start date
  • Tags Tags
    Game
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.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top