首页 开发技术 其它     /    清华大学家养智能大作业源码

清华大学家养智能大作业源码

上传者: xiaochengxun | 上传时间:2023/5/13 2:28:23 | 文件大小:74KB | 文件类型:rar
清华大学家养智能大作业源码
清华大学《家养智能》5次课程大作业源码。
java版。
搜罗遗传算法alpha-beta剪枝模拟退火算法九宫格传教士与野人等下场大概算法实现源码。

文件下载

资源详情

[{"title":"(47个子文件74KB)清华大学人工智能大作业源码","children":[{"title":"ArtificialIntelligence","children":[{"title":"TSP10.txt <span style='color:#111;'>174B</span>","children":null,"spread":false},{"title":".project <span style='color:#111;'>398B</span>","children":null,"spread":false},{"title":"bin","children":[{"title":"geneticAlgorithm","children":[{"title":"City.class <span style='color:#111;'>1.09KB</span>","children":null,"spread":false},{"title":"GeneticAlg1.class <span style='color:#111;'>8.10KB</span>","children":null,"spread":false}],"spread":true},{"title":"styleBox","children":[{"title":"A_Algorithm_2.class <span style='color:#111;'>5.61KB</span>","children":null,"spread":false},{"title":"A_Algorithm.class <span style='color:#111;'>5.53KB</span>","children":null,"spread":false}],"spread":true},{"title":"alpha_Beta","children":[{"title":"Node.class <span style='color:#111;'>2.51KB</span>","children":null,"spread":false},{"title":"AlphaBetaCuttingAlgorithm.class <span style='color:#111;'>5.16KB</span>","children":null,"spread":false},{"title":"AlphaBeta.class <span style='color:#111;'>5.11KB</span>","children":null,"spread":false},{"title":"MultiTree.class <span style='color:#111;'>1.67KB</span>","children":null,"spread":false}],"spread":true},{"title":"missionariesAndSavage","children":[{"title":"Frame.class <span style='color:#111;'>2.92KB</span>","children":null,"spread":false},{"title":"Test.class <span style='color:#111;'>4.11KB</span>","children":null,"spread":false},{"title":"FindPath.class <span style='color:#111;'>3.58KB</span>","children":null,"spread":false},{"title":"Frame$ButtonListener.class <span style='color:#111;'>3.30KB</span>","children":null,"spread":false},{"title":"State.class <span style='color:#111;'>1.29KB</span>","children":null,"spread":false},{"title":"AcrossRiverImproved.class <span style='color:#111;'>2.89KB</span>","children":null,"spread":false}],"spread":true},{"title":"segmentation","children":[{"title":"ImageSegmentation.class <span style='color:#111;'>8.22KB</span>","children":null,"spread":false},{"title":"Unit.class <span style='color:#111;'>1.40KB</span>","children":null,"spread":false},{"title":"Pixel.class <span style='color:#111;'>1.27KB</span>","children":null,"spread":false},{"title":"GASegmentation.class <span style='color:#111;'>7.76KB</span>","children":null,"spread":false}],"spread":true},{"title":"simulatedAnnealing","children":[{"title":"City.class <span style='color:#111;'>1.10KB</span>","children":null,"spread":false},{"title":"TspAlgorithm.class <span style='color:#111;'>5.38KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":".settings","children":[{"title":"org.eclipse.jdt.core.prefs <span style='color:#111;'>629B</span>","children":null,"spread":false}],"spread":true},{"title":"src","children":[{"title":"geneticAlgorithm","children":[{"title":"City.java <span style='color:#111;'>664B</span>","children":null,"spread":false},{"title":"GeneticAlg1.java <span style='color:#111;'>7.99KB</span>","children":null,"spread":false}],"spread":true},{"title":"styleBox","children":[{"title":"A_Algorithm_2.java <span style='color:#111;'>6.77KB</span>","children":null,"spread":false},{"title":"A_Algorithm.java <span style='color:#111;'>6.22KB</span>","children":null,"spread":false}],"spread":true},{"title":"alpha_Beta","children":[{"title":"AlphaBeta.java <span style='color:#111;'>4.87KB</span>","children":null,"spread":false},{"title":"AlphaBetaCuttingAlgorithm.java <span style='color:#111;'>4.92KB</span>","children":null,"spread":false},{"title":"Node.java <span style='color:#111;'>1.54KB</span>","children":null,"spread":false},{"title":"MultiTree.java <span style='color:#111;'>899B</span>","children":null,"spread":false}],"spread":true},{"title":"missionariesAndSavage","children":[{"title":"SayHello.java <span style='color:#111;'>149B</span>","children":null,"spread":false},{"title":"Test.class <span style='color:#111;'>2.96KB</span>","children":null,"spread":false},{"title":"Frame.java <span style='color:#111;'>3.68KB</span>","children":null,"spread":false},{"title":"Test.java <span style='color:#111;'>4.75KB</span>","children":null,"spread":false},{"title":"FindPath.java <span style='color:#111;'>3.42KB</span>","children":null,"spread":false},{"title":"State.java <span style='color:#111;'>1.13KB</span>","children":null,"spread":false},{"title":"SayHello.class <span style='color:#111;'>442B</span>","children":null,"spread":false},{"title":"State.class <span style='color:#111;'>984B</span>","children":null,"spread":false},{"title":"AcrossRiverImproved.java <span style='color:#111;'>2.46KB</span>","children":null,"spread":false}],"spread":true},{"title":"segmentation","children":[{"title":"ImageSegmentation.java <span style='color:#111;'>8.84KB</span>","children":null,"spread":false},{"title":"GASegmentation.java <span style='color:#111;'>7.59KB</span>","children":null,"spread":false},{"title":"Unit.java <span style='color:#111;'>2.57KB</span>","children":null,"spread":false}],"spread":true},{"title":"simulatedAnnealing","children":[{"title":"City.java <span style='color:#111;'>666B</span>","children":null,"spread":false},{"title":"TspAlgorithm.java <span style='color:#111;'>4.91KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"TSP20.txt <span style='color:#111;'>304B</span>","children":null,"spread":false},{"title":".classpath <span style='color:#111;'>301B</span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

  • iprocoder:
    写的很精巧,值得学习2015-07-01
  • 画城听雨眠:
    效果不错可以运行。2015-06-22
  • u010641260:
    挺好的算法写的都不错2014-12-16
  • a747104542:
    写的很精巧,值得学习2014-02-24
  • chlde2500:
    遗传算法,没给出输入文件。自己不知道文件格式。。。奔着清华大学的名气来的,结果用不了。。。2013-07-24

免责申明

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