The Knight's Tour is a mathematical puzzle that has endured over 1000 years.  The question is simple enough - a knight (which can move as illustrated above) wants to visit all the squares on a chess board only once.  What paths can it take?  You can vary the problem by requiring that the knight starts... Continue Reading →