One afternoon at a friend's house, I discovered AnimaLogic. We tried to solve the hardest problem at the back of the book, but found it near-impossible - until I tried to solve it 'like a computer'. Back at my computer, I decided to write an algorithm in Java that could solve any AnimaLogic puzzle. After sharing it around, a friend helped me get in contact with the game's creator and programmer, Mark Engelberg. With his help, I've refined the program, and it's been featured in one of Mark's industry presentations comparing Java to Closure (see below link).
Later on, after completing a Scala class and better understanding recursion, I decided to recreate the algorithm using tail recursion in Scala.
