Accesso libero

The Maximum Queens Problem with Pawns

  
08 dic 2016
INFORMAZIONI SU QUESTO ARTICOLO

Cita
Scarica la copertina

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.

Lingua:
Inglese
Frequenza di pubblicazione:
2 volte all'anno
Argomenti della rivista:
Matematica, Matematica generale