Robot Maze

CS118: Programming for Computer Scientists Coursework
Java

Date: October 2016 - December 2016

Programmed a controller for a robot in a maze which can detect adjacent cells in the maze and uses its current position and state to determine the direction it will move. Algorithms and structures such as: Depth-first graph search, Trémaux's algorithms and Stacks were used to traverse the maze. The controller was made to work on perfect mazes and ones with single or multiple loops. The final Grand Finale controller used data from the first run to traverse the maze more efficiently the second time. This project was my first experience using Java.

Robot Maze

Features

  • Created a controller which can succesfully find the end of the maze using Depth-first graph search implemented using a Stack.
  • Modified the controller to work on single and multiple looped mazes using Trémaux's algorithm.
  • After the first run the controller completes the maze in the most efficient route possible for perfect mazes.
  • Completes the maze with 0 collisions.
  • Achieved 100% on the coursework.
Robot Maze

Marking

For this coursework I recieved a score of 100/100.

Screenshots

Robot Maze
Robot Maze
Robot Maze