A GENERALIZATION OF THE n-QUEEN PROBLEM
摘要
A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×nchessboard in such a way that each row and each column contains exactly k‘queens’and eachdiagonal with length from 1 to n and slope either 1 or -1 contains at most k‘queens’.Aconstruction is given to show that this is always possible whenever n≥4 and n≥k≥1.
引用本文（GB/T 7714）
乐茂华, 李慰萱, Edward Edward, 等. A GENERALIZATION OF THE n-QUEEN PROBLEM[J]. 系统科学与复杂性：英文版, 1990.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。