Dante's Star

Binary names: generator <x> <y> [perfect], solver <maze.txt>
Group members:
- @Kilio22
- @HeyShafty
Mark : 90%

Subject

The goal of this project is to generate mazes (in a reasonable amount of time), solve them (in a reasonable amount of time), and print the solution.

⚠️ System functions and libC are allowed, but no external libraries

What is a maze ?

Here is the maze format description:
- Mazes are rectangular.
- They are coded in ASCII.
- The ‘X’s represent the walls and the’*’s represent the free spaces.
- It is possible to move to the four surrounding squares (up, down, right, left).
- “Start” is in the upper left-hand corner (0;0)
- “Finish” is in the bottom right-hand corner.
- A solution is a series of free, adjacent squares, from “Start” to “Finish” included.
- “Start” and “Finish” can be occupied. In this case, there is no solution.
- The last line of the maze doesn’t terminate with a return line.
- Resolution: in order to write the solution in the maze, we use ‘o’ for the solution path

⚠️ The Maze must be mazy enough.

Imperfect maze

An imperfect maze must contain clusters.
The requirements are the same as for perfect mazes.
The generation method is up to you, but it must work in an acceptable amount of time.

Input: maze size
Output: a maze with the required size on the standard output.

⚠️ The maze must have at least one solution.

Perfect maze

A perfect maze is a maze that has no loops and no clusters; therefore, following a wall makes us cross the entire maze.
The generation method is up to you, but it must work in an acceptable amount of time.

Input: maze size (width/height).
Output: a maze with the required size on the standard output.

⚠️ The maze must have a solution.
💡 The maze should be really perfect.
💡 The maze should be really really perfect.

Solving mazes