title: Breadth First Search vs A* with Manhattan Distance in a maze
body: <p>Given an initial state and a single final state in a maze, is it possible to design a maze in which breadth first search expands less nodes than A* with manhattan distance as heuristic function? The cost of expanding to all nodes is 1.</p>