Wikipedia has it and that may be a good starting point. If you follow the links you'll find algorithms and implementations in some languages. Porting them to Perl should be a good exercise for you.
In reply to Re: Find solution to knight's tour
by blazar
in thread Find solution to knight's tour
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |