- The Explorer can only move through spaces " " within the maze
- Only one final route is required to print out
- The Explorer can move backward in case of dead end
- The explorer will randomly select an open route to proceed if there were more than one adjacent empty spaces
- The maze has a sealed boundary and no open walls
- The Explorer should search for a path from the starting position "S" to the "F" position until it finds one or until it exhausts all options
- Assume no BDD is required for this sample
- Assume there is no requirement to find shortest possible path from start to finish.
- Add BDD Cucumber test steps
- Code refactoring
- Find path algorithm can be improved for shortest possible path from start to finish.