| A GENERALIZATION OF THE n-QUEEN PROBLEM |
| |
| 引用本文： | 乐茂华,李慰萱,Edward T.Wang. A GENERALIZATION OF THE n-QUEEN PROBLEM[J]. 系统科学与复杂性, 1990, 0(2) |
| |
| 作者姓名： | 乐茂华 李慰萱 Edward T.Wang |
| |
| 作者单位： | Changsha Railway Institute Hunan，China，Changsha Railway Institute，Hunan，China，Wilfrid Laurier University，Waterloo，Ont.，Canada |
| |
| 摘 要： | 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.
|
A GENERALIZATION OF THE n-QUEEN PROBLEM |
| |
| Le Maohua Li Weixuan. A GENERALIZATION OF THE n-QUEEN PROBLEM[J]. Journal of Systems Science and Complexity, 1990, 0(2) |
| |
| Authors: | Le Maohua Li Weixuan |
| |
| Abstract: | |
| |
| Keywords: | Chessboard covering n-queen problem combinatorial configuration |
| 本文献已被 CNKI 等数据库收录！ |
