holmes apcs period 05
Cathy Cai & Jeffrey Rusovskiy
Return a boolean for the statement: "The maze is navigable, having a legal and continuous travel path that traverses from any start start to any treasure."
When asked to navigate a path, the recursive abstraction can navigate a path with one less stepping stone.
You are on the treasure or there are no more paths available.
if "E" is on the treasure, return true
if there are no more paths available, return false
else if "E" is on a stepping stone
for each direction
move "E"
invoke recursive abstraction