在该图中 In this graph,
我们的任务是找到从红色单元格到绿色单元格的路径 our task is to find a path from the red cell to the green cell.
对人类来说 For humans,
通过查看图形便可以轻易找出最佳路径 it’s easy to figure out the best path just by looking at the graph.
但对于计算机而言 这并不明显 For a computer, this is less obvious
计算机必须检查是否存在通往目的地的任何路径 The computer has to check if any path leads to the goal.
计算机可能竭尽所能地尝试所有可能的路径 The computer could exhaustively try all the possible paths
以找到最短的路径 to find the shortest one.
但是 这需要耗费大量时间 However, this takes a lot of time,
尤其是在地图非常大的时候 especially when the map gets larger.
从任何给定的节点来看 From any given node,
我们最多有 8 个用于下一步的选项 we have up to 8 options for our next step
因为存在 8 个相邻的单元格 since we have 8 adjacent cells.
对于这 8 个选项中的每一个 And for each of those 8 options,
我们在下一步有另外 8 个选项 we have another 8 options for the following step.
如果我们展开所有节点 If we expand all the nodes,
搜索量将暴增至即使最快的计算机 the search will explode beyond what
也无法处理的程度 even the fastest computer could handle.