My participation
- Branch & Bound algorithm
- Program design
- Minor contribution at Back Tracking algorithm
Maze LS is a program developed for the Advanced Programming subject at La Salle University. The program is able to solve mazes with unfixed map size and key requirements. For its implementation we had to develop it in four different ways (two with backtracking and two with branch & bound).