In corner mazes, there are four dots, one in each corner. Our new search problem is to find the shortest path through the maze that touches all four corners (whether the maze actually has food there or not). Note that for some mazes like tinyCorners, the shortest path does not always go to the closest food first! Hint: the shortest path through tinyCorners takes 28 steps.
Implement the CornersProblem search problem in searchAgents.py. You will need to choose a state representation that encodes all the information necessary to detect whether all four corners have been reached. Now, your search agent should solve:
88 So why do we have these books? Intellectual activity has its own momentum and three of the authors teach at universities; perhaps the fourth aspires to do so as well. All of the authors were beneficiaries of public and private grants to write their books, and all benefited from federal publication subsidies.150 Both Flanagan and Cairns fault academics for inflaming Aboriginal expectations without seriously considering the adverse effects on Canada; yet both of them appear to be part of the problem they criticize.151 Perhaps they should both consider building hockey rinks. 2b1af7f3a8