AbstractsComputer Science

This project describes a method for solving mazes using a path finding algorithm, specifically DFS. Its input consists of the NXT lego robot along with a color sensor and a colored ball, the constructed maze and a text (.txt) file that describes the structure of the maze. Subsequently, the output of our program in order of execution is the identification of the provided colored ball, the calculation of the maze's solution (path) and the actual movement of the robot through the maze carrying the ball until the exit.