Needless-Recursion

Your task is to create a fully-functional mini-application called 'Recursive Maze Solver' using the Python package 'Needless-Recursion'. This application will generate a simple maze and solve it using one of the unnecessarily recursive algorithms provided by the 'Needless-Recursion' package. Here are the detailed steps and features for your project:

1. **Maze Generation**: Develop a feature that generates a simple 2D maze using a standard algorithm like Prim's or Recursive Division. Ensure the maze is represented as a grid of cells where walls separate each cell.
2. **Visualization**: Implement a basic graphical user interface (GUI) using a library such as Pygame or Tkinter to visualize the maze. The GUI should display the maze and highlight the path taken by the solver as it progresses.
3. **Solver Integration**: Utilize the 'Needless-Recursion' package to implement a maze-solving algorithm. Choose an algorithm from the package that demonstrates unnecessary recursion, such as a depth-first search with redundant recursive calls. Ensure that the solver finds a path from the start to the end of the maze.
4. **Performance Analysis**: Add a feature that measures and displays the time taken by the solver to find a solution. Highlight the inefficiency of using a deeply recursive approach by comparing it with a non-recursive version of the same algorithm if possible.
5. **User Interaction**: Allow users to interact with the maze by generating new mazes of different sizes and solving them using the recursive solver. Include options for the user to pause, resume, or restart the solving process.
6. **Documentation**: Write clear and concise documentation explaining how to install and run the application, including any dependencies on external libraries like 'Needless-Recursion', Pygame, or Tkinter.

This project aims to showcase both the creative and potentially inefficient use of recursion in solving real-world problems, providing insights into the trade-offs between readability and performance.