曲阜师范大学学报（自然科学版）2004，Vol.30Issue(4)：51-53,3.
关于史坦因豪斯棋盘问题的一个证明
A PROOF OF STEINHAUS CHESSBOARD PROBLEM
万玉 1赵立宽2
作者信息
- 1. 青岛科技大学信控学院计算机系,266042
- 2. 青岛科技大学数理系,266042,山东省青岛市
- 折叠
摘要
Abstract
The authors extend Hugo D Steinhaus chessboard problem with a detailed proof. The problem says: Some mines are buried in some checks on a chessboard, such that no matter where we put the queen, she can not move from the left side of the chessboard to the right side, under such an assumption, a castle can move from the top side of the chessboard to the bottom side only along those checks where there are mines. We show that it is true for the case of any m×n chessboard.关键词
国际象棋/棋盘问题/皇后/车Key words
chess/chessboard problem/queen/castle分类
数理科学引用本文复制引用
万玉,赵立宽..关于史坦因豪斯棋盘问题的一个证明[J].曲阜师范大学学报（自然科学版）,2004,30(4):51-53,3.
