文件名称:search-(1)
介绍说明－－下载内容均来自于网络，请自行研究使用
这是著名的伯克利大学人工智能这门课上讨论的贪吃蛇游戏Pacman,其中讨论了UCS，A＊, DFS, BFS 这几种搜索算法-It s the famous game Pacman. The code includes search algorithm like UCS，A＊, DFS, BFS
(系统自动生成,下载前可以参看下载内容)
下载文件列表
search
......\autograder.py
......\util.py
......\grading.py
......\layout.py
......\pacmanAgents.py
......\test_cases
......\..........\CONFIG
......\..........\q6
......\..........\..\CONFIG
......\..........\..\corner_sanity_3.solution
......\..........\..\corner_sanity_1.test
......\..........\..\corner_sanity_2.solution
......\..........\..\corner_sanity_3.test
......\..........\..\medium_corners.test
......\..........\..\corner_sanity_1.solution
......\..........\..\medium_corners.solution
......\..........\..\corner_sanity_2.test
......\..........\q2
......\..........\..\graph_manypaths.test
......\..........\..\graph_backtrack.solution
......\..........\..\CONFIG
......\..........\..\graph_infinite.test
......\..........\..\pacman_1.solution
......\..........\..\graph_infinite.solution
......\..........\..\graph_backtrack.test
......\..........\..\graph_bfs_vs_dfs.solution
......\..........\..\graph_bfs_vs_dfs.test
......\..........\..\graph_manypaths.solution
......\..........\..\pacman_1.test
......\..........\q4
......\..........\..\graph_manypaths.test
......\..........\..\graph_backtrack.solution
......\..........\..\CONFIG
......\..........\..\astar_2_manhattan.solution
......\..........\..\astar_3_goalAtDequeue.solution
......\..........\..\graph_backtrack.test
......\..........\..\astar_2_manhattan.test
......\..........\..\astar_1_graph_heuristic.solution
......\..........\..\astar_3_goalAtDequeue.test
......\..........\..\astar_1_graph_heuristic.test
......\..........\..\astar_0.test
......\..........\..\astar_0.solution
......\..........\..\graph_manypaths.solution
......\..........\q8
......\..........\..\closest_dot_6.solution
......\..........\..\closest_dot_6.test
......\..........\..\closest_dot_11.solution
......\..........\..\closest_dot_13.test
......\..........\..\CONFIG
......\..........\..\closest_dot_5.solution
......\..........\..\closest_dot_3.test
......\..........\..\closest_dot_8.solution
......\..........\..\closest_dot_4.test
......\..........\..\closest_dot_2.test
......\..........\..\closest_dot_11.test
......\..........\..\closest_dot_8.test
......\..........\..\closest_dot_1.solution
......\..........\..\closest_dot_2.solution
......\..........\..\closest_dot_12.test
......\..........\..\closest_dot_4.solution
......\..........\..\closest_dot_9.solution
......\..........\..\closest_dot_10.solution
......\..........\..\closest_dot_7.test
......\..........\..\closest_dot_10.test
......\..........\..\closest_dot_12.solution
......\..........\..\closest_dot_9.test
......\..........\..\closest_dot_3.solution
......\..........\..\closest_dot_13.solution
......\..........\..\closest_dot_5.test
......\..........\..\closest_dot_7.solution
......\..........\..\closest_dot_1.test
......\..........\q5
......\..........\..\corner_tiny_corner.test
......\..........\..\CONFIG
......\..........\..\corner_tiny_corner.solution
......\..........\q1
......\..........\..\graph_manypaths.test
......\..........\..\graph_backtrack.solution
......\..........\..\CONFIG
......\..........\..\graph_infinite.test
......\..........\..\pacman_1.solution
......\..........\..\graph_infinite.solution
......\..........\..\graph_backtrack.test
......\..........\..\graph_bfs_vs_dfs.solution
......\..........\..\graph_bfs_vs_dfs.test
......\..........\..\graph_manypaths.solution
......\..........\..\pacman_1.test
......\..........\q3
......\..........\..\ucs_2_problemE.test
......\..........\..\ucs_1_problemC.test
......\..........\..\graph_manypaths.test
......\..........\..\graph_backtrack.solution
......\..........\..\CONFIG
......\..........\..\ucs_3_problemW.solution
......\..........\..\graph_infinite.test
......\..........\..\ucs_0_graph.solution
......\..........\..\ucs_5_goalAtDequeue.test
......\..........\..\ucs_0_graph.test
......\..........\..\graph_infinite.solution