Combined sorting algorithms in single worksheet.
Trampoline solved the stack overflowing exception but DFS is not fast enough to solve some mazes. The puzzle website reported the solution took more than 10s to complete so the application was terminated. Will look into other alogrithms to solve the execution speed.
Added absurd test maze for verifying new maze solving algorithm.
Prototyped BFS but way points from start to end were not recorded properly. The way points were recorded regardless of whether they will lead to a solution or not.
Prototype BSF completed with nodes pretty printed.
1. Changed maze solution to use DFS. Solved most test mazes including small "crazy maze". It still hangs with large "crazy maze".
2. Used history to track visited nodes to force graph into one way tree structure.
3. Removed a blocking stone at the exit from maze-crazy.txt layout. It was a layout bug.
1. 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 moves. When new moves were created, they were pointed to the same position and inserted into the new queue as duplicate new moves. So, it is better to filter away the  moves in the new queue with positions already visited.
1. Refactored by streamlined methods looking for new postions.
2. Removed redundant isLegal(...) method.
3. Still unable to cut time to solve maze by half i.e. approximately 5s.
1. Refactored Move.
2. Added Clojure BFS simple implementation.