Epitech group (duo) project to do a maze generator & solver. I did the generator, my mate the solver.
On the screen it is a 15 x 15 map, generated & solved. You can try it with bigger maps.
C - Algorithm
How to check valgrind (memory leak), and how to optimise my algorithm.
Clone the project
git clone git@github.com:anthonyardhuin/dante.git
Go to the project directory
cd dante
Compile the project
make
Start the algorithm
./generator/generator "SIZE" "SIZE"
or
./solver/solver "FILE_TO_SOLVER"
How to use generator map in solver ?
./generator/generator "SIZE" "SIZE" > "NAME_OF_FILE"
or
./solver/solver "NAME_OF_FILE"
Create a simple thing, which is a maze, and optimise the program to do it quickly. (15 x 15 is not the same time spent as a 500 x 500).
'X' is a Wall '*' is an Empty place 'o' is the best way to the end
๐ฌ Beginner so be kind and give tips
๐ง Currently learning C, Node.js, Docker, MySQL