Thread: Knight's Tour

  1. #31
    Join Date
    Aug 2001
    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.

  2. #32
    Registered User Nutshell's Avatar
    Join Date
    Jan 2002
    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.


Popular pages Recent additions subscribe to a feed

Similar Threads

  1. knight's tour!
    By Jasin14 in forum C Programming
    Replies: 13
    Last Post: 12-22-2010, 04:30 PM
  2. Knight's Tour: couting problems
    By Sektor in forum C++ Programming
    Replies: 3
    Last Post: 01-19-2004, 12:46 PM
  3. Knight's Tour Recursion Problem
    By thephreak6 in forum C++ Programming
    Replies: 1
    Last Post: 10-14-2003, 09:18 AM
  4. Knights Tour Trivia
    By shrestha in forum C++ Programming
    Replies: 2
    Last Post: 01-16-2003, 08:32 AM
  5. Knight's Tour Problem 2
    By Nutshell in forum C Programming
    Replies: 11
    Last Post: 01-09-2002, 09:32 PM