🚀 go-pugleaf

I realize this might be just a little off the topic (but hopefully not too
much). I would very much like to find some source code for the Knight's Tour
problem. This is the problem where you have a lone knight on a chess board and 
the goal is to have your knight visit all of the squares on the board and 
return to his starting place without visiting any square twice. 

I would especially be interested in C source code that solves our knight's
dilema, either from an ftp site, book, etc.        

If anyone knows of any repositories of source code to solve these sorts of
problems (Knights Tour, N-Queens problem, etc.) I would appreciate any tips. 
I generally enjoy these sorts of computing problems so anyone who knows of 
any interesting variations on the Knight's Tour or N-Queens problem etc. 
I would sure like to hear about them. 

Ted Pedersen