Forever Odd

Essentially what the game consists of is you enter the size of your maze as an integer n (ie: 10) and then it generates a random maze of size nxn (ie: 10×10) which can be different for each nxn matrix you generate. Do to time restraints I wasn’t able to implement the A* search like I wanted to so I did it recursively. The downfall for this is that for a maze 29×29 or greater it may or may not work depending on how fast it finds the end point. This is because the stack is not big enough so you get a stack overflow error. Just the same it was an interesting project. Give it a try if you like.

Screenshots:

Freshly generated maze

Solved maze.

Note that since this is a school project nothing beyond the requirements was added (hence no About section or anything like that).

Windows (all): Maze (exe)
Linux (right click and open with Java): Maze (jar)
Mac users should be able to use the same as Linux.

Windows users can use the jar version too if they prefer. When downloading the jar version, make sure it has the extension .jar (ie: in windows may try to download as .zip, replace zip with jar).