The Maximum Queens Problem with Pawns-Reference-Cited by-同舟云学术

The Maximum Queens Problem with Pawns

Published:2016-12-01 Issue:6 Volume:3 Page:95-102
ISSN:2182-1976
Container-title:Recreational Mathematics Magazine
language:en
Short-container-title:

Author:

Chatham Doug¹

Affiliation:

1. Morehead State University, Department of Mathematics and Physics, United States of America

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

General Chemical Engineering

Reference6 articles.

1. [1] Bell, J., Stevens, B.“A survey of known results and research areas for n-queens”, Discrete Math, 309, 1-31, 2009.

2. [2] Chatham, R. D., Doyle, M., Fricke, G. H., Reitmann, J., Skaggs, R. , Wolff, M.“Independence and domination separation on chessboard graphs”, J. Combin. Math. Combin. Comput, 68, 3-17, 2009.

3. [3] Chatham, R. D., Fricke, G. H., Skaggs, R. D.“The queens separation problem”, Util. Math, 69, 129-141, 2006.

4. [4] Kosters, W. A. n-Queens bibliography, 2016. http://www.liacs.nl/home/kosters/nqueens/

5. [5] Watkins, J. J. Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, 2004.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independence and domination on shogiboard graphs;Recreational Mathematics Magazine;2017-12-20