Documentation - How to Solve the Galactic Maze

Your goal is to write a function named solve(maze) that takes a 2D array representing the maze. The array is named maze and it provides all the details about walls, paths, start, and end points in the maze.

Maze Structure:

The maze is represented as a 2D array, where each element can be one of the following:

• # - Wall: Represents an obstacle that cannot be passed.
• . - Path: Represents an open space where you can move.
• S - Start: The starting point of the maze, typically located at (1, 1).
• E - End: The endpoint of the maze, which you need to reach to solve the maze.

Accessing and Manipulating the Maze Array:

The maze is a 2D array where:

• maze[i][j] gives you the element at row i and column j.
• Walls are represented by '#', which means you cannot move through those cells.
• The start point is represented by 'S', and it is the initial position from which you need to find a path to the endpoint.
• The end point is represented by 'E', which is your target destination in the maze.

To solve the maze, you will need to traverse from the start position ('S') and find a path to the end position ('E') using valid movements. The movements must be made within the boundaries of the array and avoid walls ('#').

Available Movements:

• U - Move up
• D - Move down
• L - Move left
• R - Move right

Tips for Solving the Maze:

• Depth-First Search (DFS): Explore paths deeply before backtracking.
• Breadth-First Search (BFS): Ideal for finding the shortest path.
• Marking Visited Cells: Avoid revisiting cells to prevent loops.
• Edge Cases: Handle scenarios where no path exists.

Back to Galactic Maze Challenge

We hope this documentation helps you understand how to solve the Galactic Maze Challenge. Happy coding!