Article Details

Version for online viewing      Version for printing

The maximum queens problem with pawns
Doug Chatham
The classic n-queens problem asks for placements of just n mutually non-attacking queens on an nxn 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 mxn boards.
chess, n-queens problem, combinatorics
Published: 2016/12/08
Author Details
Doug Chatham
Morehead State University, Department of Mathematics and Physics

     About us | Editorial Board | To the authors | Contact us