This robot is able to solve every solvable maze and find shortest way from start to finish. Start is located in bottom right corner and finish is located in bottom left corner.
In first step robot explores maze, creating map of possible moves. When all accessible fields have been visited at least once, robot stops exploration. Thanks to created map, it is able to find shortest way back to start point, and then shortest way from start to finish point.
Program have been written in Brixcc in NXT language.
Link to this comment:
All Comments (2)