A slight problem with my Knights Tour algorithm (java)
I'm all out of fish, but I have a fishing manual here:
In the above function, print out the board on every step. Then follow the execution until it produces "incorrect" result.
After you're up to this step, look into getMove2() method. Print every step through there, until you find where the wrong choice is made.
And so on, repeat until you come to the statement that causes the error. You can also use the debugger for this.
public void solveTour() { while (count < 65) { getMove2(rowPos, colPos); count++; } }In the above function, print out the board on every step. Then follow the execution until it produces "incorrect" result.
After you're up to this step, look into getMove2() method. Print every step through there, until you find where the wrong choice is made.
And so on, repeat until you come to the statement that causes the error. You can also use the debugger for this.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
