八数码问题求解(源码+说明文档)

上传者: uraplutonium | 上传时间: 2021-04-10 21:38:45 | 文件大小: 3.94MB | 文件类型: RAR
开发平台:VS2005 开发语言:C++ 实现功能:用深度优先、广度优先、局部择优、全局择优、A*算法解决八数码问题,使用MFC,界面交互性良好。 包含内容:完整的项目文件(包含所有源代码),一个简单的说明文档。

文件下载

资源详情

[{"title":"( 54 个子文件 3.94MB ) 八数码问题求解(源码+说明文档)","children":[{"title":"eight puzzle","children":[{"title":"eight_puzzle.ncb <span style='color:#111;'> 14.30MB </span>","children":null,"spread":false},{"title":"eight_puzzle.sln <span style='color:#111;'> 901B </span>","children":null,"spread":false},{"title":"eight_puzzle.suo <span style='color:#111;'> 48.50KB </span>","children":null,"spread":false},{"title":"Readme.txt <span style='color:#111;'> 107B </span>","children":null,"spread":false},{"title":"release","children":null,"spread":false},{"title":"TESTS","children":[{"title":"test1","children":[{"title":"Path_A_Algorithm.txt <span style='color:#111;'> 165B </span>","children":null,"spread":false},{"title":"Path_Width_First.txt <span style='color:#111;'> 165B </span>","children":null,"spread":false},{"title":"Path_Local_Optimum.txt <span style='color:#111;'> 8.78KB </span>","children":null,"spread":false},{"title":"Path_Global_Optimum.txt <span style='color:#111;'> 180B </span>","children":null,"spread":false}],"spread":true},{"title":"test3","children":[{"title":"Path_Local_Optimum3.txt <span style='color:#111;'> 7.06KB </span>","children":null,"spread":false},{"title":"Path_A_Algorithm3.txt <span style='color:#111;'> 169B </span>","children":null,"spread":false},{"title":"Path_Global_Optimum3.txt <span style='color:#111;'> 180B </span>","children":null,"spread":false},{"title":"Path_Width_First3.txt <span style='color:#111;'> 169B </span>","children":null,"spread":false}],"spread":true},{"title":"test4","children":[{"title":"Path_Global_Optimum4.txt <span style='color:#111;'> 218B </span>","children":null,"spread":false},{"title":"Path_Depth_First4.txt <span style='color:#111;'> 306B </span>","children":null,"spread":false},{"title":"Path_Local_Optimum4.txt <span style='color:#111;'> 6.76KB </span>","children":null,"spread":false},{"title":"Path_A_Algorithm4.txt <span style='color:#111;'> 179B </span>","children":null,"spread":false}],"spread":true},{"title":"test2","children":[{"title":"Path_Depthfirst2.txt <span style='color:#111;'> 5.56KB </span>","children":null,"spread":false},{"title":"Path_Global_Optimum2.txt <span style='color:#111;'> 174B </span>","children":null,"spread":false},{"title":"Path_Local_Optimum2.txt <span style='color:#111;'> 203B </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"八数码程序说明文档.doc <span style='color:#111;'> 279.58KB </span>","children":null,"spread":false},{"title":"eight_puzzle","children":[{"title":"eight_puzzle.vcproj <span style='color:#111;'> 6.40KB </span>","children":null,"spread":false},{"title":"eight_puzzle.aps <span style='color:#111;'> 60.18KB </span>","children":null,"spread":false},{"title":"resource.h <span style='color:#111;'> 2.64KB </span>","children":null,"spread":false},{"title":"SetDlg.h <span style='color:#111;'> 478B </span>","children":null,"spread":false},{"title":"eight_puzzle.vcproj.uraplutonium-PC.uraplutonium.user <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"Global_optimum.h <span style='color:#111;'> 674B </span>","children":null,"spread":false},{"title":"stdafx.h <span style='color:#111;'> 2.48KB </span>","children":null,"spread":false},{"title":"Engine.cpp <span style='color:#111;'> 1.97KB </span>","children":null,"spread":false},{"title":"Box.h <span style='color:#111;'> 501B </span>","children":null,"spread":false},{"title":"eight_puzzle.rc <span style='color:#111;'> 9.28KB </span>","children":null,"spread":false},{"title":"A_algorithm.h <span style='color:#111;'> 672B </span>","children":null,"spread":false},{"title":"eight_puzzleDlg.h <span style='color:#111;'> 1.92KB </span>","children":null,"spread":false},{"title":"eight_puzzle.cpp <span style='color:#111;'> 1.69KB </span>","children":null,"spread":false},{"title":"Global_optimum.cpp <span style='color:#111;'> 6.95KB </span>","children":null,"spread":false},{"title":"Width_first.h <span style='color:#111;'> 583B </span>","children":null,"spread":false},{"title":"Depth_first.h <span style='color:#111;'> 558B </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"BuildLog.htm <span style='color:#111;'> 6.84KB </span>","children":null,"spread":false}],"spread":false},{"title":"stdafx.cpp <span style='color:#111;'> 352B </span>","children":null,"spread":false},{"title":"Engine.h <span style='color:#111;'> 384B </span>","children":null,"spread":false},{"title":"ReadMe.txt <span style='color:#111;'> 2.79KB </span>","children":null,"spread":false},{"title":"Depth_first.cpp <span style='color:#111;'> 5.67KB </span>","children":null,"spread":false},{"title":"A_algorithm.cpp <span style='color:#111;'> 7.03KB </span>","children":null,"spread":false},{"title":"SetDlg.cpp <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"Local_optimum.cpp <span style='color:#111;'> 6.59KB </span>","children":null,"spread":false},{"title":"eight_puzzle.vcproj.asus-PC.asus.user <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"Release","children":[{"title":"BuildLog.htm <span style='color:#111;'> 6.68KB </span>","children":null,"spread":false}],"spread":false},{"title":"eight_puzzle.h <span style='color:#111;'> 477B </span>","children":null,"spread":false},{"title":"res","children":[{"title":"eight_puzzle.rc2 <span style='color:#111;'> 368B </span>","children":null,"spread":false},{"title":"eight_puzzle.ico <span style='color:#111;'> 21.12KB </span>","children":null,"spread":false}],"spread":false},{"title":"Width_first.cpp <span style='color:#111;'> 5.83KB </span>","children":null,"spread":false},{"title":"Box.cpp <span style='color:#111;'> 5.75KB </span>","children":null,"spread":false},{"title":"Local_optimum.h <span style='color:#111;'> 602B </span>","children":null,"spread":false},{"title":"eight_puzzleDlg.cpp <span style='color:#111;'> 12.49KB </span>","children":null,"spread":false}],"spread":false},{"title":"debug","children":[{"title":"eight_puzzle.ilk <span style='color:#111;'> 1.26MB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • liulishc :
    挺详细的适合学习
    2015-07-13
  • Albert_lk :
    很详细,不过好像不是我要的
    2015-06-09
  • ufo874718527 :
    还不错,可以学习到很多
    2015-05-16
  • hzpsky :
    还可以符合大作业要求
    2014-06-18
  • u010483577 :
    不错,我觉得实用!!!
    2014-05-18
  • 北枫byTG :
    看着还行,VS的没用过,主要是看看文档
    2013-12-09
  • elani :
    不错,学到了很多。谢谢分享~
    2013-12-01
  • 疯鎏菜籽521 :
    可以运行,说明文档很给力
    2013-11-19
  • 寒吻秋雨西 :
    对于学习那几个搜索算法帮助很大,很精细。
    2013-11-19
  • 宁缺之华 :
    非常好的资源,很详细,很适合研究
    2013-11-17

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明