Uneingeschränkter Zugang

The Maximum Queens Problem with Pawns

   | 08. Dez. 2016

Zitieren

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.

eISSN:
2182-1976
Sprache:
Englisch
Zeitrahmen der Veröffentlichung:
2 Hefte pro Jahr
Fachgebiete der Zeitschrift:
Mathematik, Allgemeines