Does anyone has an idea how to do this one or is there a website where i can get info on how this can be done.

I need to write a program that can do this:

A classical chess problem: is it possible to make the horse visit every square once using its
usual chess moves?

Actually, to accomplish this task, there is a nice heuristic that states that player can start from
any square and should move the horse to the next legal but not-yet-visited square according
to the following rule: consider all the legal but not-yet-visited squares and pick the one that
would have the maximum number of legal moves next.