Implemented different search algorithms for a pacman to solve a maze

• Depth First Search explores the deepest part of a branch before moving to the next one

• Breadth First Search explores the entire depth before going deeper

• Uniform Cost Search explores the cheapest route

• A* explores a branch depending on a heuristic that weighs the different paths

• Uses A* to find the shortest path that collects all of the dots