A simple and flexible maze-solving algorithm implemented in Java.
The solver reads a maze from a .txt file, parses it into a grid, and finds a valid path from an entrance on the top row to an exit on any border (left, right, bottom).
The maze can be any size as long as it follows two rules:
- Entrance is on the top row.
- Exit is on the left, right, or bottom boundary.
- β Reads maze from an external text file
- β Works on any maze layout fitting the entrance/exit rules
- β Uses Breath First Search (BFS)
- β Prevents revisiting nodes
- β Outputs:
- Full coordinate path
- β Clean, object-oriented structure