Modify the program from the case study to print out the path without dead ends and, possibly, with detours. For example, for an input maze
11111111e0000111101111000001100m0011111111
the program from the case study outputs the processed maze
11111111e....1111.1111.....11..m..11111111Success
The modified program should, in addition, generate the path from the exit to the mouse:
[1 1] [1 2] [1 3] [2 3] [3 3] [3 4] [3 5] [4 5] [4 4] [4 3]
which leaves out two dead ends, [1 4] [1 5] and [3 2] [3 1] [4 1] [4 2], but retains a detour, [3 4] [3 5] [4 5] [4 4].
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.