Timeline for answer to The Bunny's Tour by d'alar'cop
Current License: CC BY-SA 3.0
Post Revisions
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 8:22 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:50 | history | edited | CommunityBot |
replaced http://puzzling.stackexchange.com/ with https://puzzling.stackexchange.com/
|
|
| Nov 1, 2014 at 19:58 | history | edited | d'alar'cop | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 1, 2014 at 14:29 | comment | added | d'alar'cop | @miracle173 Hi. I have added a definition of "reachable" in the accepted version of this answer. $w$ is just any arbitrary walk - it doesn't matter what the walk was. I'm aware of that link - I linked to it - and had an answer on that question too | |
| Nov 1, 2014 at 11:55 | comment | added | miracle173 |
What is the meaning of reachable? From what w are you talking about? There are a lot of quadruples (w1,w2,w3,w4) of distinct walks that cover all squares of a color. 3 examples are found in How many bishops to walk across the board. If s is a1 (using the board coordinates as used in the algebraic chess notation) what is w?
|
|
| Nov 1, 2014 at 5:28 | history | edited | d'alar'cop | CC BY-SA 3.0 |
added 1 character in body
|
| Oct 31, 2014 at 10:01 | comment | added | d'alar'cop | @warspyking I'll try to tie them together | |
| Oct 31, 2014 at 9:58 | vote | accept | warspyking | ||
| Nov 1, 2014 at 11:29 | |||||
| Oct 31, 2014 at 9:58 | comment | added | warspyking | I'd appreciate it if this was on the bounty answer but I'll accept this I guess. | |
| Oct 31, 2014 at 5:50 | history | edited | d'alar'cop | CC BY-SA 3.0 |
added 107 characters in body
|
| Oct 31, 2014 at 5:37 | history | edited | d'alar'cop | CC BY-SA 3.0 |
added 1 character in body
|
| Oct 31, 2014 at 5:22 | history | answered | d'alar'cop | CC BY-SA 3.0 |