Have a personal or library account? Click to login
The Maximum Queens Problem with Pawns Cover
By: Doug Chatham  
Open Access
|Dec 2016

References

  1. [1] Bell, J., Stevens, B.“A survey of known results and research areas for n-queens”, Discrete Math, 309, 1-31, 2009.10.1016/j.disc.2007.12.043
  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.10.1515/9781400840922
  6. [6] Zhao, K. The Combinatorics of Chessboards, Ph.D. dissertation, City University of New York, 1998.
Language: English
Page range: 95 - 102
Published on: Dec 8, 2016
Published by: Ludus Association
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2016 Doug Chatham, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.