<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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. </p></abstract>

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.

The Maximum Queens Problem with Pawns

Morehead State University, Department of Mathematics and Physics,

Recreational Mathematics Magazine

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

{"article-title":"The Maximum Queens Problem with Pawns"}

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...

The Maximum Queens Problem with Pawns

Online veröffentlicht: 08. Dez. 2016

Seitenbereich: 95 - 102

DOI: https://doi.org/10.1515/rmm-2016-0010

Schlüsselwörter
chess, n-queens problem, combinatorics

© 2016

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

The Maximum Queens Problem with Pawns

Online veröffentlicht: 08. Dez. 2016

Seitenbereich: 95 - 102

DOI: https://doi.org/10.1515/rmm-2016-0010

Schlüsselwörterchess, n-queens problem, combinatorics

© 2016

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

Schlüsselwörter
chess, n-queens problem, combinatorics