文件名称:Model-answer
- 所属分类：
- 控制台(字符窗口)编程
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2015-05-04
- 文件大小：
- 1.54mb
- 下载次数：
- 0次
- 提 供 者：
- king*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
4.24 (Knight’s Tour) One of the more interesting puzzlers for chess buffs is the Knight’s Tour problem, originally proposed by
the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and touch
each of the 64 squares once and only once? We study this intriguing problem in depth here.
The knight makes L-shaped moves (over two in one direction and then over one in a perpendicular direction). Thus, a
square in the middle of an empty chessboard, the knight can make eight different moves (numbered 0 through 7)-4.24 (Knight’s Tour) One of the more interesting puzzlers for chess buffs is the Knight’s Tour problem, originally proposed by
the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and touch
each of the 64 squares once and only once? We study this intriguing problem in depth here.
The knight makes L-shaped moves (over two in one direction and then over one in a perpendicular direction). Thus, a
square in the middle of an empty chessboard, the knight can make eight different moves (numbered 0 through 7)
the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and touch
each of the 64 squares once and only once? We study this intriguing problem in depth here.
The knight makes L-shaped moves (over two in one direction and then over one in a perpendicular direction). Thus, a
square in the middle of an empty chessboard, the knight can make eight different moves (numbered 0 through 7)-4.24 (Knight’s Tour) One of the more interesting puzzlers for chess buffs is the Knight’s Tour problem, originally proposed by
the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and touch
each of the 64 squares once and only once? We study this intriguing problem in depth here.
The knight makes L-shaped moves (over two in one direction and then over one in a perpendicular direction). Thus, a
square in the middle of an empty chessboard, the knight can make eight different moves (numbered 0 through 7)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Model answer\bin\Release\Model answer.exe
............\main.cpp
............\Model answer.cbp
............\Model answer.depend
............\Model answer.layout
............\obj\Release\main.o
............\bin\Release
............\obj\Release
............\bin
............\obj
Model answer
How to Program C++-Instructor's Manual - Deitel.pdf