Timeline for What is the longest possible sequence of double checks?
Current License: CC BY-SA 4.0
43 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2024 at 14:58 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 18 characters in body |
| Jun 21, 2024 at 14:48 | history | edited | Rewan Demontay | CC BY-SA 4.0 | Streamlining |
| Dec 30, 2020 at 22:21 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 12 characters in body |
| Aug 30, 2020 at 20:34 | history | edited | Rewan Demontay | CC BY-SA 4.0 | edited body |
| Jun 16, 2020 at 14:54 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 383 characters in body; edited tags |
| Jun 16, 2020 at 14:47 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 383 characters in body |
| Jun 16, 2020 at 14:38 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 383 characters in body |
| May 18, 2020 at 18:59 | answer | added | Rewan Demontay | timeline score: 1 | |
| May 18, 2020 at 18:04 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 2 characters in body |
| May 18, 2020 at 16:55 | history | edited | Rewan Demontay | CC BY-SA 4.0 | edited body |
| May 18, 2020 at 16:49 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 620 characters in body |
| May 18, 2020 at 16:43 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 620 characters in body |
| May 18, 2020 at 16:38 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 620 characters in body |
| May 18, 2020 at 16:22 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 109 characters in body |
| May 18, 2020 at 16:17 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 109 characters in body |
| May 18, 2020 at 16:02 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 283 characters in body |
| May 18, 2020 at 15:52 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 496 characters in body; edited tags |
| Nov 14, 2019 at 2:11 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 12 characters in body |
| Nov 13, 2019 at 19:19 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 54 characters in body |
| Nov 13, 2019 at 15:40 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 303 characters in body |
| Jun 5, 2019 at 15:36 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 555 characters in body |
| Jun 5, 2019 at 12:42 | comment | added | Evargalo | A (nice) problem from 2004 cannot be "the orginal problem in which [the double staircase] appears." I won't be surprised if you were off by a century ! | |
| Jun 4, 2019 at 20:42 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 1010 characters in body |
| Apr 29, 2019 at 15:16 | history | edited | Rewan Demontay | edited tags | |
| Apr 16, 2019 at 6:00 | history | tweeted | twitter.com/StackChess/status/1118031325800402946 | ||
| Apr 10, 2019 at 0:53 | vote | accept | Rewan Demontay | ||
| Apr 8, 2019 at 16:35 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 194 characters in body |
| Apr 8, 2019 at 16:22 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 194 characters in body |
| Apr 8, 2019 at 14:31 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 282 characters in body |
| Apr 8, 2019 at 13:42 | history | edited | Rewan Demontay | CC BY-SA 4.0 | deleted 26 characters in body |
| Apr 8, 2019 at 13:14 | answer | added | Evargalo | timeline score: 7 | |
| Apr 8, 2019 at 9:50 | review | Close votes | |||
| Apr 8, 2019 at 21:02 | |||||
| Apr 8, 2019 at 9:20 | comment | added | Evargalo | Depending of how you handle threefold repetitions, the answer might be infinity, with W:Ka8,Ba1,Bh1,Re4 / B: Kd5 : 1.Rd4 Ke5 2.Re4 Kd5 3.Rd4 etc. | |
| Apr 8, 2019 at 7:54 | comment | added | Hauke Reddmann | Ba1 Bb1 Rb2 - Kc3 is a well known mechanism. 11 double checks. Also, the downvoters may have a point insofar as this SE is more dedicated to OTB than problem chess (still, I earned tons of undeserved upvotes by just quoting a position I happened to know from another forum, answering a problem chess question :-). That said, why don't you carry your question to the MatPlus forum, where the problem chess enthusiasts sit? They will be most interested (and also beat your records in no time :-) | |
| Apr 8, 2019 at 5:12 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 135 characters in body |
| Apr 8, 2019 at 4:21 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 254 characters in body; edited title |
| Apr 8, 2019 at 3:24 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 186 characters in body; edited title |
| Apr 8, 2019 at 2:47 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 5 characters in body |
| Apr 8, 2019 at 2:09 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 302 characters in body |
| Apr 8, 2019 at 1:48 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 107 characters in body |
| Apr 7, 2019 at 23:48 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 74 characters in body |
| Apr 7, 2019 at 23:26 | history | edited | Rewan Demontay | CC BY-SA 4.0 | added 16 characters in body |
| Apr 7, 2019 at 20:24 | history | asked | Rewan Demontay | CC BY-SA 4.0 |