The project is to build a system in Java that solves mazes. The mazes will be described by numbered nodes and pairwise connections. The system should take a file name as an argument, and a second argument that says whether the system should generate one or all solutions to the maze. The two modes are thus, give one solution, and give all solutions. Example test data is given.

The system should be run on the training mazes.

The system should solve the three training sets ( maze 1, maze 2, and maze 3) in both modes. Note that in all of the mazes, the starting state is 0, and the goal state is 1.

You need to use the system clock to time the algorithm. Use System.nanoTime(); Report times for all solutions and the first solution.

Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.