1. Prototyped BFS with simple tree with pretty printed nodes.
2. Changed maze solution to use BFS.
3. The structure didn't work in a top down manner. History was used to track visited nodes to force graph into one way tree structure.
4. Removed a blocking stone at the exit from maze-crazy.txt layout. It was a layout bug.
5. Crazy maze was not solved because the filter was not in the right place. It should be filtering the new queue instead of the new neighbours. When new neighbours were created, they were pointed to the same position and inserted into the new queue as duplicate neighbours. So, it is right to filter away the neighbours in the new queue with positions already visited.
6. Removed redundant isLegal(...) method and tidied up legal movements
comparison.
7. Refactored Move.
8. Added Clojure BFS simple implementation.
9. Still unable to cut time to solve maze by half i.e. approximately 5s.