The Non-Attacking Queens Game

@article{Noon2006TheNQ,
  title={The Non-Attacking Queens Game},
  author={Hassan A Noon and Glen van Brummelen},
  journal={College Mathematics Journal},
  year={2006},
  volume={37},
  pages={223}
}

Figures from this paper

A generalization of Arc-Kayles
TLDR
A generalization of this game, Weighted Arc Kayles (WAK for short), played on graphs with counters on the vertices, is studied and it is proved that the Grundy values of WAK and Arc-Kayles are unbounded. Expand
Criticalité, identification et jeux de suppression de sommets dans les graphes : des étoiles plein les jeux
Dans cette these, nous etudions des problematiques de graphes et de jeux combinatoires. Il existe de nombreux liens entre ces deux domaines : ainsi, les jeux sont un bon moyen de modeliser uneExpand
Criticalité, identification et jeux de suppression de sommets dans les graphes. (Criticality, identification and vertex deletion games on graphs)
TLDR
Il existe de nombreux liens entre ces deux domaines : ainsi, les jeux sont un bon moyen de modeliser une opposition dans un probleme d'optimisation, et dans l'autre sens plusieurs jeux classiques sont definis sur les graphes. Expand
On the N Non-Attacking Queens Problem
In this paper, a new version of the proof of the n-queens problem was presented. A new condition for the diagonal conflicts between the queens was added for the proof of the theorem.
Successful strategies for a queens placing game on an n x n chess board
TLDR
This article gives very simple always winning strategies for the first player if n is 4 or odd, and additionally the source package of the provided computer program QPGAME3 has been used to check that there are successful strategies forThe first playerif n is 6 or 8, and for the second player ifn is 10, 12, 14, or 16. Expand
N-queens — 330 References How It All Began One Article to Hold Them All Searchable Online Database
TLDR
This paper currently contains 330 references to articles dealing with or at least touching upon the well-known n-Queens problem, and it is proved constructively that any finite subgraph of the rectangular grid or the hexagonal grid is a queens graph. Expand

References

SHOWING 1-4 OF 4 REFERENCES
The eight queens problem as a strategy game
A strategy game is presented that is strongly connected to the classical ‘eight queens problem’ for checkerboards. Two different versions of the game are analysed with computer assistance. TheExpand
Winning Ways for Your Mathematical Plays
In the quarter of a century since three mathematicians and game theorists collaborated to create Winning Ways for Your Mathematical Plays, the book has become the definitive work on the subject ofExpand
Gauss and the eight queens problem: A study in miniature of the propagation of historical error
Abstract An 1874 article by J. W. L. Glaisher asserted that the eight queens problem of recreational mathematics originated in 1850 with Franz Nauck proposing it to Gauss, who then gave the completeExpand