Thread: Knight's Tour

operator ':=' mean?

Assignment in pascal.

You only passed two arguments but in the function declaration you specified 4 parameters

Pass in count+1 and final_path. It is a success when the number of moves is 63 because that would have to mean that the knight has been to every square. If number of moves is less than 63 it is a success when one branch is a success. It is a failure when the knight is stuct with only being able to move to used square or none of the branches are success.

I am not at all smart and i'm sorry to still not fully understand how to write a recursive version of my program. I guess i have to do more exercise on recursion until i can get the hand of it. I've posted another question about knight's tour in a new thread, that question is simple.

thnx