Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Find solution to knight's tour

by robot_tourist (Hermit)
on Jun 01, 2007 at 13:06 UTC ( #618731=note: print w/ replies, xml ) Need Help??


in reply to Find solution to knight's tour

a bit of recursive backtracking might work. My CS lecturer didn't require checkpoints. IIRC my (java) solution worked for board sizes up to 6x6, then took too long (or crashed) for 7x7, but worked for 8x8. I never bothered to find out why. Although I may be getting confused with the killer queens puzzle. I should really have a look at both again in perl.

How can you feel when you're made of steel? I am made of steel. I am the Robot Tourist.
Robot Tourist, by Ten Benson


Comment on Re: Find solution to knight's tour
Re^2: Find solution to knight's tour
by moklevat (Priest) on Aug 27, 2007 at 19:47 UTC
    I realize this post is old, but I just came across it and wanted to post a reply in case someone else came across it and wondered why your 7x7 board did not work. For m x m boards, there is no closed tour when m is odd.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://618731]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2014-10-24 23:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (138 votes), past polls