0

I happened to try find the total number of ways a horse can cover all 64 squares in a chess board without visiting a square more than once starting from one corner.

All I was able to do was to use a brute force algorithm which run for a whole day just to find about 400000 answers.

Can any one please help to improve the programs performance.