sraaphorst/spelunker

FInd neighbours

sraaphorst opened this issue · 1 comments

If we can implement, in the general case, an algorithm to return the neighbours of a given Cell in the maze, then we can program BFS as per #110 directly in AbstractMaze.

This is done for Maze, GraphMaze, and ThickMaze, with test cases added for Maze and ThickMaze that helped me fix some errors and architectural shortcomings.

Still unsure about GraphMaze, as I may want to do something more with this class.