For part 1, BFS is used since there is no need to
visit each splitter more than once to count visited
splitters.
For part 2, the code initially removed the visited
check. This failed miserably, losing momentum aound
Y=54-56.
A recursive function with memoization solves it much
faster.
