CDN加速镜像 | 设为首页 | 加入收藏夹
当前位置: 首页 资源下载 源码下载 游戏 其他智力游戏

文件名称:search-(1)

介绍说明--下载内容来自于网络,使用问题请自行百度

这是著名的伯克利大学人工智能这门课上讨论的贪吃蛇游戏Pacman,其中讨论了UCS,A*, DFS, BFS 这几种搜索算法-It s the famous game Pacman. The code includes search algorithm like UCS,A*, DFS, BFS
(系统自动生成,下载前可以参看下载内容)

下载文件列表

search/
search/autograder.py
search/util.py
search/grading.py
search/layout.py
search/pacmanAgents.py
search/test_cases/
search/test_cases/CONFIG
search/test_cases/q6/
search/test_cases/q6/CONFIG
search/test_cases/q6/corner_sanity_3.solution
search/test_cases/q6/corner_sanity_1.test
search/test_cases/q6/corner_sanity_2.solution
search/test_cases/q6/corner_sanity_3.test
search/test_cases/q6/medium_corners.test
search/test_cases/q6/corner_sanity_1.solution
search/test_cases/q6/medium_corners.solution
search/test_cases/q6/corner_sanity_2.test
search/test_cases/q2/
search/test_cases/q2/graph_manypaths.test
search/test_cases/q2/graph_backtrack.solution
search/test_cases/q2/CONFIG
search/test_cases/q2/graph_infinite.test
search/test_cases/q2/pacman_1.solution
search/test_cases/q2/graph_infinite.solution
search/test_cases/q2/graph_backtrack.test
search/test_cases/q2/graph_bfs_vs_dfs.solution
search/test_cases/q2/graph_bfs_vs_dfs.test
search/test_cases/q2/graph_manypaths.solution
search/test_cases/q2/pacman_1.test
search/test_cases/q4/
search/test_cases/q4/graph_manypaths.test
search/test_cases/q4/graph_backtrack.solution
search/test_cases/q4/CONFIG
search/test_cases/q4/astar_2_manhattan.solution
search/test_cases/q4/astar_3_goalAtDequeue.solution
search/test_cases/q4/graph_backtrack.test
search/test_cases/q4/astar_2_manhattan.test
search/test_cases/q4/astar_1_graph_heuristic.solution
search/test_cases/q4/astar_3_goalAtDequeue.test
search/test_cases/q4/astar_1_graph_heuristic.test
search/test_cases/q4/astar_0.test
search/test_cases/q4/astar_0.solution
search/test_cases/q4/graph_manypaths.solution
search/test_cases/q8/
search/test_cases/q8/closest_dot_6.solution
search/test_cases/q8/closest_dot_6.test
search/test_cases/q8/closest_dot_11.solution
search/test_cases/q8/closest_dot_13.test
search/test_cases/q8/CONFIG
search/test_cases/q8/closest_dot_5.solution
search/test_cases/q8/closest_dot_3.test
search/test_cases/q8/closest_dot_8.solution
search/test_cases/q8/closest_dot_4.test
search/test_cases/q8/closest_dot_2.test
search/test_cases/q8/closest_dot_11.test
search/test_cases/q8/closest_dot_8.test
search/test_cases/q8/closest_dot_1.solution
search/test_cases/q8/closest_dot_2.solution
search/test_cases/q8/closest_dot_12.test
search/test_cases/q8/closest_dot_4.solution
search/test_cases/q8/closest_dot_9.solution
search/test_cases/q8/closest_dot_10.solution
search/test_cases/q8/closest_dot_7.test
search/test_cases/q8/closest_dot_10.test
search/test_cases/q8/closest_dot_12.solution
search/test_cases/q8/closest_dot_9.test
search/test_cases/q8/closest_dot_3.solution
search/test_cases/q8/closest_dot_13.solution
search/test_cases/q8/closest_dot_5.test
search/test_cases/q8/closest_dot_7.solution
search/test_cases/q8/closest_dot_1.test
search/test_cases/q5/
search/test_cases/q5/corner_tiny_corner.test
search/test_cases/q5/CONFIG
search/test_cases/q5/corner_tiny_corner.solution
search/test_cases/q1/
search/test_cases/q1/graph_manypaths.test
search/test_cases/q1/graph_backtrack.solution
search/test_cases/q1/CONFIG
search/test_cases/q1/graph_infinite.test
search/test_cases/q1/pacman_1.solution
search/test_cases/q1/graph_infinite.solution
search/test_cases/q1/graph_backtrack.test
search/test_cases/q1/graph_bfs_vs_dfs.solution
search/test_cases/q1/graph_bfs_vs_dfs.test
search/test_cases/q1/graph_manypaths.solution
search/test_cases/q1/pacman_1.test
search/test_cases/q3/
search/test_cases/q3/ucs_2_problemE.test
search/test_cases/q3/ucs_1_problemC.test
search/test_cases/q3/graph_manypaths.test
search/test_cases/q3/graph_backtrack.solution
search/test_cases/q3/CONFIG
search/test_cases/q3/ucs_3_problemW.solution
search/test_cases/q3/graph_infinite.test
search/test_cases/q3/ucs_0_graph.solution
search/test_cases/q3/ucs_5_goalAtDequeue.test
search/test_cases/q3/ucs_0_graph.test
search/test_cases/q3/graph_infinite.solution
search/test_cases/q3/graph_backtrack.test
search/test_cases/q3/graph_bfs_vs_dfs.solution
search/test_cases/q3/ucs_2_problemE.solution
search/test_cases/q3/ucs_3_problemW.test
search/test_cases/q3/ucs_5_goalAtDequeue.solution
search/test_cases/q3/ucs_4_testSearch.test
search/test_cases/q3/ucs_1_problemC.solution
search/test_cases/q3/graph_bfs_vs_dfs.test
search/test_cases/q3/graph_manypaths.solution
search/test_cases/q3/ucs_4_testSearch.solution
search/test_cases/q7/
search/test_cases/q7/food_heuristic_2.test
search/test_cases/q7/food_heuristic_grade_tricky.solution
search/test_cases/q7/food_heuristic_17.test
search/test_cases/q7/food_heuristic_6.solution
search/test_cases/q7/food_heuristic_3.test
search/test_cases/q7/CONFIG
search/test_cases/q7/food_heuristic_1.solution
search/test_cases/q7/food_heuristic_9.test
search/test_cases/q7/food_heuristic_7.solution
search/test_cases/q7/food_heuristic_7.test
search/test_cases/q7/food_heuristic_12.test
search/test_cases/q7/food_heuristic_3.solution
search/test_cases/q7/food_heuristic_4.test
search/test_cases/q7/food_heuristic_16.test
search/test_cases/q7/food_heuristic_16.solution
search/test_cases/q7/food_heuristic_11.solution
search/test_cases/q7/food_heuristic_13.solution
search/test_cases/q7/

相关说明

  • 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
  • 搜珍网是交换下载平台,只提供交流渠道,下载内容来自于网络,除下载问题外,其它问题请自行百度。更多...
  • 本站已设置防盗链,请勿用迅雷、QQ旋风等下载软件下载资源,下载后用WinRAR最新版进行解压.
  • 如果您发现内容无法下载,请稍后再次尝试;或换浏览器;或者到消费记录里找到下载记录反馈给我们.
  • 下载后发现下载的内容跟说明不相乎,请到消费记录里找到下载记录反馈给我们,经确认后退回积分.
  • 如下载前有疑问,可以通过点击"提供者"的名字,查看对方的联系方式,联系对方咨询.

相关评论

暂无评论内容.

发表评论

*快速评论: 推荐 一般 有密码 和说明不符 不是源码或资料 文件不全 不能解压 纯粹是垃圾
*内  容:
*验 证 码:
搜珍网 www.dssz.com