This is the first of two maze problems. The routes to the goal in
this case are easy to see. The problem for the solver is to find
the shortest route. Of course, you can solve the problem
yourself; it is less easy to represent it to the automatic solver.
Copyright By PowCoder代写 加微信 powcoder
Above is a simple grid, with some small squares
blocked out:
There is a robot in square Ad, and it needs to find its
way to the goal in square Dd. At each step it can
move to any adjacent square (North, South, East or
West) but must avoid the blocked ones.
Find the shortest path it can follow (note that there
are 4 equally short paths, so the solution is not
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com