5. Formulate a search problem to find the shortest path through the maze that touches all four
6. Implement a non-trivial, consistent heuristic for the CornersProblem.
I'm trying to implement search algorithms and heuristics as part of the Pacman1 game. The Pacman agent will find paths through his maze world, both to reach a particular location and
to collect food efficiently.