Hello,
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?
