|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re: Find solution to knight's tourby robot_tourist (Hermit) |
| on Jun 01, 2007 at 13:06 UTC ( [id://618731]=note: print w/replies, xml ) | Need Help?? |
|
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.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||