This board is closed and will be kept as an archive. Please head to our new home at tch-forum.com
(Existing members: Please check your PMs for your password on the new board. If you do not have a PM, then please send one to me)
| Welcome to The Coffee House - your dose of caffeine! The Coffee House is a friendly and informal community dedicated to having fun. We're a diverse bunch, and so we have plenty to offer, including:
Join our community! If you're already a member please log in to your account to access all of our features: |
| Knight's Tour | |
|---|---|
| Tweet Topic Started: Dec 31 2010, 06:20 PM (319 Views) | |
| CJ | Dec 31 2010, 06:20 PM Post #1 |
|
A very minor case of serious brain damage
![]()
|
The Knight's Tour is a problem that relates to the Knight's move in chess. The Knight starts on a square of a chess board, and must then move around the board, visiting each square exactly once. Such a tour is called 'closed' if the Knight finishes on a square that attacks the square it started from (so it can immediately move back to where it started after completing the tour); otherwise, it's called 'open'. Here's an animation of one. This one is open: |
![]() |
|
| Michelle | Dec 31 2010, 06:33 PM Post #2 |
|
.
![]()
|
Wow, too complicated for me, but looks cool. |
![]() |
|
| CJ | Dec 31 2010, 10:42 PM Post #3 |
|
A very minor case of serious brain damage
![]()
|
I must admit, I've never tried to solve it myself. There are a great many possible solutions, though (somewhere in the trillions). |
![]() |
|
| Michelle | Jan 1 2011, 04:02 AM Post #4 |
|
.
![]()
|
Umm... okay, wow. |
![]() |
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · Science and Nature · Next Topic » |







8:35 AM Jul 11