Thread: 8 knights problem.

  1. #1
    Registered User
    Join Date
    Jan 2008

    8 knights problem.

    i read the problem given in array's chapter in deitel and deitel's book which said that the knights should traverse the whole chessboard and visit each box only once. I read it and was quite impressed but it's pretty tough to solve it. I solved the 8 queen problem but this sounds pretty tough.
    Please can anybody provide me the algorithm or some good link through which i can get help or may be a genuine hint that will help me?

  2. #2
    Kernel hacker
    Join Date
    Jul 2007
    Farncombe, Surrey, England
    Search the web for "Knights tour", and you'll find some thoughts on the matter.

    Compilers can produce warnings - make the compiler programmers happy: Use them!
    Please don't PM me for help - and no, I don't do help over instant messengers.

  3. #3
    Master Apprentice phantomotap's Avatar
    Join Date
    Jan 2008
    The "N-Knights" problem is different than the "Knight's Tour" problem. Throw the right thing at Google at you'll find plenty of good links. Either, I think, is a subset of an NP-Complete problem. You'd probably do fine by "memorizing" a small number of solutions and breaking the board up into known chunks.


Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Memory problem with Borland C 3.1
    By AZ1699 in forum C Programming
    Replies: 16
    Last Post: 11-16-2007, 11:22 AM
  2. Someone having same problem with Code Block?
    By ofayto in forum C++ Programming
    Replies: 1
    Last Post: 07-12-2007, 08:38 AM
  3. A question related to strcmp
    By meili100 in forum C++ Programming
    Replies: 6
    Last Post: 07-07-2007, 02:51 PM
  4. WS_POPUP, continuation of old problem
    By blurrymadness in forum Windows Programming
    Replies: 1
    Last Post: 04-20-2007, 06:54 PM
  5. beginner problem
    By The_Nymph in forum C Programming
    Replies: 4
    Last Post: 03-05-2002, 05:46 PM