Timeline for Knight's tour game (7x7)
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 2, 2022 at 17:42 | history | edited | DLosc | edited tags | |
| S Jan 14, 2020 at 13:11 | history | bounty ended | Adám | ||
| S Jan 14, 2020 at 13:11 | history | notice removed | Adám | ||
| S Jan 8, 2020 at 10:43 | history | bounty started | Adám | ||
| S Jan 8, 2020 at 10:43 | history | notice added | Adám | Reward existing answer | |
| Jan 2, 2020 at 8:31 | answer | added | Bubbler | timeline score: 3 | |
| Nov 24, 2014 at 21:09 | history | tweeted | twitter.com/#!/StackCodeGolf/status/536990085225644033 | ||
| Sep 29, 2014 at 15:48 | answer | added | R.T. | timeline score: 1 | |
| Sep 29, 2014 at 14:18 | comment | added | Peter Taylor | @Quincunx, no, it's not the only similar question. And there's another one which was closed as a dupe. | |
| Sep 29, 2014 at 13:50 | history | edited | 6160 | CC BY-SA 3.0 | deleted 16 characters in body |
| Sep 29, 2014 at 13:47 | answer | added | laurencevs | timeline score: 1 | |
| Sep 29, 2014 at 9:29 | comment | added | Level River St | Actually, thinking about it, because a knight always alternates between black and white squares, he has to start and finish on squares of the same colour as the corner squares. If the corner squares are black and he starts on a white square, he will run out of white squares (24) before he has visited all the black squares (25). So it's not always possible to complete the tour. | |
| Sep 28, 2014 at 23:17 | comment | added | Level River St | According to mathworld.wolfram.com/KnightGraph.html There are no closed tours for m×m boards with m odd so it's not possible to take a single looped solution and simply start on a different square. That makes this reasonably interesting and not a direct duplicate of the linked question, which leaves the start square to choice. According to en.wikipedia.org/wiki/Knight's_tour there are 16557521832 directed tours on a 7x7 board so I imagine at least one starts on every square. I assume we only have to find one valid solution for the given input, not all of them! | |
| Sep 28, 2014 at 22:59 | history | edited | 6160 | CC BY-SA 3.0 | edited title |
| Sep 28, 2014 at 22:58 | comment | added | 6160 | Didn't know that was called knight's tour! i'll change right now thanks! | |
| Sep 28, 2014 at 22:52 | comment | added | Justin | Since this is usually called the Knight's Tour, I recommend changing your challenge name to something along those lines (with 7x7). Also, usually people don't have an end date on the challenge. We usually just come by every now and then and see if the shortest answer has changed. | |
| Sep 28, 2014 at 22:52 | comment | added | proud haskeller | why won't this be called knight's tour straight away? | |
| Sep 28, 2014 at 22:50 | comment | added | Justin | Is this seriously the only similar question? I thought this website covered the Knight's Journey/Knight's Tour pretty thoroughly. As it is, I have no idea if this is close enough to be a duplicate of the other post. | |
| Sep 28, 2014 at 22:47 | history | asked | 6160 | CC BY-SA 3.0 |