Maze solver.
Bhavesh Shah, George Shey
Return a boolean value of whether there is a path between the start and 'treasure'.
When I am asked to find a path between the start and the 'treasure', the recursive abstraction can find a path to the treasure from the next point.
The base case would be when the explorer is on a wall (return false), or if the explorer is on the treasure (return true).
Base case would solve a maze of size 1. For other mazes, the explorer would check to see if the next point is a legal point (not a wall, inside maze, etc.). The next point would be chosen in a clockwise manner (North, East, South, West). Once the explorer is on the next point, the recursive solution would try to find a path to the treasure from that new point. There would also be a variable called wasHere that would be set as true when an explorer leaves a point, so that if the explorer ends up at that point once again, the function would terminate.
Maze Class: 1) Constructor that creates a board of size n. 2) Size method. 3) Conditions method (checks to see if object hits wall or not). 4) Tostring method that prints solution to maze.
Maze Solver Class: 1) Method that solves tha maze.
Version 0: -find and express if a path between start and destination exists with a boolean value -identify key parts of recursion
Version 0's base cases work. The recursive solution still needs some modification and is under development.