Steinhaus棋盘问题是波兰著名数学家Steinhaus在其著作Problem and Discussion中提出的一个比较有趣的问题,文献[2-3]分别用不同的方法给以证明,但是证明过程较为复杂.通过比较直观的方式给出了该问题的简单证明,并给出了该问题在图论...Steinhaus棋盘问题是波兰著名数学家Steinhaus在其著作Problem and Discussion中提出的一个比较有趣的问题,文献[2-3]分别用不同的方法给以证明,但是证明过程较为复杂.通过比较直观的方式给出了该问题的简单证明,并给出了该问题在图论中的等价命题.展开更多
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 ...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 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.
