EE160 Programming for Engineers

What is the maze solver?

• this program will run each student's solver to see which solver can solve a particular maze the fastest

How to participate in the maze solver?

• you will be submitting your solver to the maze-solver repository
  • the solver must conform to this function prototype
  • the solver has access to any type of data that might be required
  • the main function will not alter these data arrays in anyway so feel free to use those data arrays however you would like
  • the solver also has access to a log file that can be used for debugging
  • the solver will know which direction/steps are possible via the possible_steps array, which can be parsed like this
  • the solver can also define and use custom functions
  • an example submission: zhaol_12345678.solver
• though your solver function only needs to accept and understand the possible moves and coordinates, it will be good for you to understand the maze files (e.g. simple.maze) to help troubleshoot bugs
• your solver must navigate from the NORTH-WEST corner of the maze to the SOUTH-EAST corner of the maze to complete the maze
• please follow the general submission steps given in the challenges page to submit a solver to this challenge
• please also look through the repository's README for more details about compiling and running the maze-solver program