1 A Brief Introduction to the Mathematics of …（1简要介绍的数学u2026）.pdfVIP

下载本文档

16
0
约6.78千字
约 8页
2017-07-24 发布于浙江
举报
版权申诉

1 A Brief Introduction to the Mathematics of …（1简要介绍的数学u2026）.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

1 A Brief Introduction to the Mathematics of …（1简要介绍的数学u2026）

1 A Brief Introduction to the Mathematics of Chess Puzzles Puzzles on the chessboard have long been studied by mathematicians. Nat- urally, we do not restrict ourselves only to the standard 8 8 chessboard. Gen- eralizations are quickly made to the square board, the rectangular board, etc. We will concentrate on three types of problems. 2 The Knightís Tour The closed knightís tour of a chessboard is a classic problem in mathematics. Can the knight use legal moves to visit every square on the board and return to its starting position? When translated into graph theoretic terms, this is equivalent to the existence of a Hamiltonian cycle. The unique movement of the knight makes a tour an interesting existence problem. For other chess pieces, tours are a trivial existence problem. Moves of the Knight 1 A Closed Knightís Tour of the 8 8 Chessboard While originally studied for the standard board, the problem is easily gen- eralized to rectangular boards. 1 4 7 26 13 28 11 22 19 16 6 25 2 29 8 23 14 17 10 21 3 30 5 24 27 12 9 20 15 18 A Closed Knightís Tour of the 3 10 Chessboard 2 1 22 27 12 7 16 28 11 30 15 26 13 21 2 23 8 17 6 10 29 4 19 14 25 3 20 9 24 5 18 A Closed Knightís Tour of the 5 6 Chessboard In 1991 Schwenk [1] completely answered the question: Which rectangular chessboards have a knightís tour? Theorem 1 (Schwenk) An m n chessboard with m n ha