我如何通过BFS解决迷宫问题？ [英] How Do I Solve A Maze By BFS?

问题描述

二维阵列的迷宫（n * n）



开始区块：S $ / $


结束区块：E



每块的颜色：白色（成本= 1）灰色（成本= 5）黑色（成本= +∞）



目标：以最低成本从S到E



使用图搜索算法：BFS





输出：



所选路径的迷宫地图



路径长度



路径成本

Maze (n*n)by 2D Array

start block : S

end block : E

colors of each block : white(cost =1 ) Gray(cost = 5) black(cost = +∞ )

Goal: go from S to E by minimum cost

using graph search algorithm :BFS


Output:

Maze map with the chosen path

length of the path

cost of the path

推荐答案

我们不做你的作业：这是有原因的。它就是为了让你思考你被告知的事情，并试着理解它。它也在那里，以便您的导师可以识别您身体虚弱的区域，并将更多的注意力集中在补救措施上。



亲自尝试，你可能会发现它不是和你想的一样困难！

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

这篇关于我如何通过BFS解决迷宫问题？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！