文件名称:ma-de-bian-li
介绍说明--下载内容来自于网络,使用问题请自行百度
数据结构课程设计——马的遍历:在中国象棋棋盘上,对任一位置上放置的一个马,均能选择一个合适的路线,使得该棋子能按象棋的规则不重复地走过棋盘上的每一位置。
要求:
(1)依次输出所走过的各位置的坐标。
(2)最好能画出棋盘的图形形式,并在其上动态地标注行走过程。
(3)程序能方便地地移植到其它规格的棋盘上。
-Data Structure Course Design- Horse traversal: the board in the Chinese chess on the location of any place of a horse, can choose an appropriate route, making the pieces according to chess rules can not repeatedly come on board each location. Requirements: (1) followed by the walk out the coordinates of each location. (2) best able to draw a graphical form of the board and mark on it dynamically during walking. (3) program can be easily transplanted to other specifications of the board.
要求:
(1)依次输出所走过的各位置的坐标。
(2)最好能画出棋盘的图形形式,并在其上动态地标注行走过程。
(3)程序能方便地地移植到其它规格的棋盘上。
-Data Structure Course Design- Horse traversal: the board in the Chinese chess on the location of any place of a horse, can choose an appropriate route, making the pieces according to chess rules can not repeatedly come on board each location. Requirements: (1) followed by the walk out the coordinates of each location. (2) best able to draw a graphical form of the board and mark on it dynamically during walking. (3) program can be easily transplanted to other specifications of the board.
相关搜索: ma de bian li
(系统自动生成,下载前可以参看下载内容)
下载文件列表
马的遍历课程设计.docx
horse/chess.h
horse/result.txt
horse/马的遍历.cpp
horse/马的遍历问题.exe
horse
horse/chess.h
horse/result.txt
horse/马的遍历.cpp
horse/马的遍历问题.exe
horse
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.