国际象棋马的遍历 贪心算法
国际象棋的棋盘有8×8＝64个格子，给它们规定坐标（1，1）到（8，8）。马在这64个格子的某一个格子上，它的跳动规则是：如果它现在在（x，y）位置，它下一步可以跳到（x±1，y±2）或（x±2，y±1）（所有的“±”之间没有相关性），一般来说它下一步可以有八种跳法。但是它不能跳出这64个格子。
设计算法使它不管从哪出发都可以跳遍所有的格子（每个格子只能路过一次）最后回到起点。
基本要求：（80分）
合理设计界面，自行设计国际象棋棋盘，用鼠标选择马的起始位置，起始位置选定后，按“开始”按钮演示马的每一步行走路线。棋盘和马的显示尽量美观逼真。功能菜单或按钮自行设计，以合理为目的。
扩展要求：（15分）
对算法进行优化，根据j.c.Warnsdorff规则设计算法，该规则是在所有可跳的方格中,马只可能走这样一个方格:从该方格出发,马能跳的方格数为最少；如果可跳的方格数相等,则从当前位置看,方格序号小的优先。
VS2017开发
文件下载
资源详情
[{"title":"（ 54 个子文件 20.94MB ） 国际象棋马的遍历 贪心算法","children":[{"title":"国际象棋终","children":[{"title":"国际象棋骑士遍历","children":[{"title":"Knight","children":[{"title":"ReadMe.txt <span style='color:#111;'> 3.38KB </span>","children":null,"spread":false},{"title":"res","children":[{"title":"bai+.bmp <span style='color:#111;'> 9.24KB </span>","children":null,"spread":false},{"title":"Knight.rc2 <span style='color:#111;'> 668B </span>","children":null,"spread":false},{"title":"horse5.bmp <span style='color:#111;'> 7.47KB </span>","children":null,"spread":false},{"title":"qp.bmp <span style='color:#111;'> 577.60KB </span>","children":null,"spread":false},{"title":"bg.bmp <span style='color:#111;'> 7.93MB </span>","children":null,"spread":false},{"title":"one.bmp <span style='color:#111;'> 7.48KB </span>","children":null,"spread":false},{"title":"one+.bmp <span style='color:#111;'> 9.24KB </span>","children":null,"spread":false},{"title":"KnightDoc.ico <span style='color:#111;'> 4.60KB </span>","children":null,"spread":false},{"title":"icon1.ico <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false},{"title":"Knight.ico <span style='color:#111;'> 66.19KB </span>","children":null,"spread":false},{"title":"bai.bmp <span style='color:#111;'> 7.48KB </span>","children":null,"spread":false}],"spread":false},{"title":"KnightDoc.h <span style='color:#111;'> 845B </span>","children":null,"spread":false},{"title":"KnightDoc.cpp <span style='color:#111;'> 2.45KB </span>","children":null,"spread":false},{"title":"Knight.aps <span style='color:#111;'> 8.65MB </span>","children":null,"spread":false},{"title":"Qipan.h <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"MainFrm.cpp <span style='color:#111;'> 1.61KB </span>","children":null,"spread":false},{"title":"stdafx.h <span style='color:#111;'> 1.60KB </span>","children":null,"spread":false},{"title":"KnightView.h <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"MainFrm.h <span style='color:#111;'> 670B </span>","children":null,"spread":false},{"title":"Knight.h <span style='color:#111;'> 502B </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Knight.pch <span style='color:#111;'> 52.00MB </span>","children":null,"spread":false},{"title":"MainFrm.obj <span style='color:#111;'> 73.29KB </span>","children":null,"spread":false},{"title":"vc141.pdb <span style='color:#111;'> 6.47MB </span>","children":null,"spread":false},{"title":"Knight.res <span style='color:#111;'> 8.60MB </span>","children":null,"spread":false},{"title":"vc141.idb <span style='color:#111;'> 2.46MB </span>","children":null,"spread":false},{"title":"Knight.obj <span style='color:#111;'> 47.48KB </span>","children":null,"spread":false},{"title":"Knight.log <span style='color:#111;'> 679B </span>","children":null,"spread":false},{"title":"KnightView.obj <span style='color:#111;'> 119.77KB </span>","children":null,"spread":false},{"title":"KnightDoc.obj <span style='color:#111;'> 92.22KB </span>","children":null,"spread":false},{"title":"stdafx.obj <span style='color:#111;'> 908.64KB </span>","children":null,"spread":false},{"title":"Qipan.obj <span style='color:#111;'> 61.56KB </span>","children":null,"spread":false},{"title":"Knight.tlog","children":[{"title":"CL.write.1.tlog <span style='color:#111;'> 3.22KB </span>","children":null,"spread":false},{"title":"rc.command.1.tlog <span style='color:#111;'> 374B </span>","children":null,"spread":false},{"title":"link.command.1.tlog <span style='color:#111;'> 2.10KB </span>","children":null,"spread":false},{"title":"CL.read.1.tlog <span style='color:#111;'> 108.72KB </span>","children":null,"spread":false},{"title":"CL.command.1.tlog <span style='color:#111;'> 4.49KB </span>","children":null,"spread":false},{"title":"rc.read.1.tlog <span style='color:#111;'> 4.53KB </span>","children":null,"spread":false},{"title":"link.write.1.tlog <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"Knight.lastbuildstate <span style='color:#111;'> 230B </span>","children":null,"spread":false},{"title":"rc.write.1.tlog <span style='color:#111;'> 242B </span>","children":null,"spread":false},{"title":"link.read.1.tlog <span style='color:#111;'> 7.50KB </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"stdafx.cpp <span style='color:#111;'> 141B </span>","children":null,"spread":false},{"title":"Resource.h <span style='color:#111;'> 4.10KB </span>","children":null,"spread":false},{"title":"Qipan.cpp <span style='color:#111;'> 10.65KB </span>","children":null,"spread":false},{"title":"Knight.vcxproj.user <span style='color:#111;'> 228B </span>","children":null,"spread":false},{"title":"Knight.rc <span style='color:#111;'> 22.26KB </span>","children":null,"spread":false},{"title":"Knight.vcxproj <span style='color:#111;'> 6.49KB </span>","children":null,"spread":false},{"title":"targetver.h <span style='color:#111;'> 236B </span>","children":null,"spread":false},{"title":"KnightView.cpp <span style='color:#111;'> 11.78KB </span>","children":null,"spread":false},{"title":"Knight.vcxproj.filters <span style='color:#111;'> 3.25KB </span>","children":null,"spread":false},{"title":"Knight.cpp <span style='color:#111;'> 4.14KB </span>","children":null,"spread":false}],"spread":false},{"title":"Knight.sln <span style='color:#111;'> 885B </span>","children":null,"spread":false},{"title":"Knight.suo <span style='color:#111;'> 10.00KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]
评论信息
其他资源
- 面向计算机科学的数理逻辑课后答案
- win7、win10环境的友善之臂mini2440的usb驱动
- 虚拟存储器管理——模拟内存分配与回收实验算法（c语言）
- IDL计算影像信息熵程序
- 数据结构课程设计-城市链表
- 基于ssm的问卷调查系统
- 上下位机程序源码.zip
- bun0.pcd下载
- 数据结构大作业(家谱管理系统)
- 获取屏幕坐标和RGB
- 超完美的赔率计算器3.0
- 数学建模优秀论文_长江水质的评价和预测.rar
- 理发店管理系统
- 基于迭代传播的小基高比立体匹配方法
- FPGA(EP2C70)+MCU(CY7C68013A)_SRAM_USB_7816开发板protel硬件原理图+PCB文件.zip
- 中国移动业务管理系统 SSH版.Oracle数据库
- java手机游戏 贪吃蛇 源代码.zip
- Personal_Blog.zip
- mybatis-plus.zip
- 基于jsp的学生信息管理系统
- B样条插值（B-spline interpolation）
- 通杀UltraEdit各版本的dll替换文件
- 51单片机增量式PID控制算法
- 控制电机伺服
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明