Jump to content
  • Advertisement
Sign in to follow this  
Ueneth Echil

A slight problem with my Knights Tour algorithm (java)

This topic is 3763 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Advertisement
I'm all out of fish, but I have a fishing manual here:

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.



Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!