Exploring mod 2 n-queens games

Tricia Muldoon Brown 1  and Abrahim Ladha 1
  • 1 Georgia Southern University, Georgia Institute of Technology

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.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Bell, J., Stevens, B. “A survey of known results and research areas for n-queens”, Discrete Math., 309, 1, 1–31, 2009.

  • [2] Bezzel, M. “Proposal of 8-queens problem”, Berliner Schachzeitung, 3, 363, 1848 (submitted under the author name “Schachfreund”).

  • [3] Nauck, F. “Briefwechseln mit allen für alle”, Illustrirte Zeitung, 377, 15, 182, 1850.

  • [4] Noon, H. Surreal Numbers and the N-Queens Game, Master thesis, Bennington College, 2002.

  • [5] Pauls, E. “Das Maximalproblem der Damen auf dem Schachbrete”, Deutsche Schachzeitung. Organ für das Gasammte Schachleben, 29, 5, 129–134, 1874.

  • [6] Pauls, E. “Das Maximalproblem der Damen auf dem Schachbrete, II”, Deutsche Schachzeitung. Organ für das Gasammte Schachleben, 29, 9, 257–267, 1874.

OPEN ACCESS

Journal + Issues

Search