Traditional Mazeexpert series
This is the second of two maze problems. Encoding the many walls is rather tedious, but otherwise the good solution methods are similar to those for the block maze.
If the solver is timing out, increasing the pretest limit (via the Settings button) may help. Well, it’s possible!
Find the shortest path from square Aa to the goal in square Ee. At each step, the robot may move North, South, East or West but cannot walk through the walls.
Solver
Auto Parser Results
No errors found.