Document Type
Article
Publication Date
12-8-2016
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.
Recommended Citation
Chatham, Doug, "The maximum queen’s problem with pawns" (2016). Faculty Research at Morehead State University. 218.
https://scholarworks.moreheadstate.edu/msu_faculty_research/218
COinS
Comments
Recreational Mathematics Magazine, Volume 3 (2016): Issue 6 (Dec 2016), 95-102.