Yeah, it's all over wikipedia, probably other places too, google it.
Knights Tour solution
Sort:
You can thank WikiLeaks
any better idea?
cosmofish wrote:
any better idea?
1) click this link http://www.chesscorner.com/fun/knight_tour/knight.htm
2) scroll down to the blank board
3) click the square you want the knight tour to start from (you want a8, so click a8)
4) A knight will appear and preform the tour. Each square it touches will be numbered so you can keep the sequence.
smiley15 wrote:
There's 26 trillion+ solutions... don't tell me you can't find one of them!
ya i know that it has N solutions, but I can't found 1 without repeating because I am not so good on Knights
orangehonda wrote:
cosmofish wrote:
any better idea?
1) click this link http://www.chesscorner.com/fun/knight_tour/knight.htm
2) scroll down to the blank board
3) click the square you want the knight tour to start from (you want a8, so click a8)
4) A knight will appear and preform the tour. Each square it touches will be numbered so you can keep the sequence.
TQ orangehonda
I wrote a C program to do this. You can see it (and the solutions it created) here:
http://andrews-programming-problems.blogspot.com/
There are 3 parts to it and it will make more sense if you read them in order.
If it's not clear how it works, just post a comment at the end and I will try to answer.
cosmofish wrote:
smiley15 wrote:
There's 26 trillion+ solutions... don't tell me you can't find one of them!
ya i know that it has N solutions, but I can't found 1 without repeating because I am not so good on Knights
Which is why you should practice it instead of just asking for the solution!
LOL...I think ask someone for help would be more easy
Does anyone knows the Knight's Tour solution? The Knight must start from a8 and please show on diagram mode.TQ(Knight's Tour=walking knight on chess board without repeating once)