Implementation of the Knight's Travails problem in Ruby using a node tree data structure and breadth-first search/depth-first search.