Accès libre

The Maximum Queens Problem with Pawns

  
08 déc. 2016
À propos de cet article

Citez
Télécharger la couverture

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Langue:
Anglais
Périodicité:
2 fois par an
Sujets de la revue:
Mathématiques, Mathématiques générales