| « back Browsing Levels: #442 "Knight's Tour" | |
| |
| |
| prev: #441 "Which exit works?" | next: #443 "Knights and Rotations" |
"Knight's Tour" by Brian Potetz |
|
| ||||||||||||||||||||||
| Comments (turn spoilers off) | ||||
| ||||
| 12459 | Knight's Tour | Bekah (2103) | Thu 20 Aug 2009 20:53 | |
| This was fun. Once I realized what the problem was (how to take a knight through every square of a chessboard, only visiting each square once, and ending where you started), I just pulled out my graph paper and pencil. When I had my solution, putting it into the game was easy. Thanks for the challenge. | ||||
| 6587 | Knight's Tour | Eric119 (921) | Thu 27 Jul 2006 19:09 | |
| I just solved this one. I printed off a sheet of paper with the numbers 1 through 64, cut it up into pieces with individual numbers and tried to arrange them into a tour on my chessboard. No need for erasers. :) | ||||
| 5712 | Knight's Tour | bpotetz (144) | Fri 24 Mar 2006 00:23 | SPOILER |
| That might be your problem - Euler won't help you here. Hamilton might, although he never actually solved this type of problem - just stuck his name on it. I guess that isn't much help either. Thanks for playing! | ||||
| 5703 | Knight's Tour | mm (690) | Thu 23 Mar 2006 12:50 | SPOILER |
| I must confess, I cheated, too... "but you should be able to solve it without looking up the solution or writing a program" ??? Never ever, no way, even if I do know a little maths and even if I know who is Euler. |
||||
| 3897 | Knight's Tour | John Lewis (411) | Fri 12 Aug 2005 00:57 | |
| Okay...I must confess...I cheated; I looked up a solution online... But what a neat level! I'm going to try to solve the next one soon... |
||||
| 3437 | Knight's Tour | noname (559) | Mon 11 Jul 2005 01:05 | SPOILER |
| Added speedrun: 321 moves (old: 999999). Okay, then I'll claim it. |
||||
| 3420 | Knight's Tour | mjn (118) | Sat 09 Jul 2005 15:22 | |
| I'm the one who solved it, but I cheated (I have a graph theory textbook with a knight's tour on the cover). I didn't feel right claiming the speedrun under those circumstances... | ||||
| 3411 | Knight's Tour | noname (559) | Sat 09 Jul 2005 12:28 | |
| Just wondering, why didn't anyone claim the speed record? (There is certainly someone who solved this before me, and it is clear that any solution optimized to the same length...) | ||||
| 677 | Knight's Tour | Tom 7 (1) | Tue 22 Mar 2005 19:22 | |
| Actually, all of the graphs I've made so far (probably 5+) have had multiple disjoint cycles. If only I could put those bonus points to good use! | ||||
| 674 | Knight's Tour | bpotetz (144) | Tue 22 Mar 2005 18:32 | |
| Two cycles? It sounds like you should get bonus points. Don't lose hope! | ||||
| 643 | Knight's Tour | Tom 7 (1) | Mon 21 Mar 2005 19:39 | |
| And my second, which I was much more careful about... | ||||
| 640 | Knight's Tour | Tom 7 (1) | Mon 21 Mar 2005 17:01 | |
| Dammit, it turns out my paper solution had two cycles, not one. ;) | ||||
| 624 | Knight's Tour | Tom 7 (1) | Sun 20 Mar 2005 21:13 | |
| Very very slick! | ||||
| 620 | Knight's Tour | bpotetz (144) | Sun 20 Mar 2005 16:19 | |
| BTW, I really like the zoom in & zoom out features for editing ([ and ]). It would be neat if you could play that way. | ||||
| 619 | Knight's Tour | bpotetz (144) | Sun 20 Mar 2005 16:18 | |
| Here's my implementation of the famous Knight's Tour. This puzzle is challenging, but you should be able to solve it without looking up the solution or writing a program. My original embedding idea had a smaller game board, but it required 64 hugbots. Like, what am I supposed to do with only 9 robots? |
||||