<abstract xmlns="http://www.w3.org/1999/xhtml"><p>We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the parity of the number of queens already on the board which can attack that square. The game is explored as well as its variations and complexity.</p></abstract>

We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the parity of the number of queens already on the board which can attack that square. The game is explored as well as its variations and complexity.

Exploring mod 2 <italic>n</italic>-queens games

Recreational Mathematics Magazine

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":{"italic":"n","content":["Exploring mod 2","-queens games"]}}

We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by...

Exploring mod 2 n-queens games

Publicado en línea: 11 oct 2019

Páginas: 15 - 25

DOI: https://doi.org/10.2478/rmm-2019-0002

Palabras clave
Chess, independence, -queens

© 2019 Tricia Muldoon Brown et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Exploring mod 2 n-queens games

Publicado en línea: 11 oct 2019

Páginas: 15 - 25

DOI: https://doi.org/10.2478/rmm-2019-0002

Palabras claveChess, independence, -queens

© 2019 Tricia Muldoon Brown et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
Chess, independence, -queens