Timeline for A variant of the 2-Chess Games overlapped
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29 at 2:41 | vote | accept | JKHA | ||
| Aug 17 at 21:03 | comment | added | Daniel Mathias | @BenjaminWang Trivial lower bound is 9 moves on each board, as black must make 8 captures in one game. | |
| Aug 17 at 17:04 | comment | added | Benjamin Wang | Trivial lower bound is 8.5 moves on each board. Because we need 30 total captures which requires at least 7.5 moves on each board. And the first 1.0 moves no one can capture. | |
| Aug 17 at 11:11 | comment | added | wimi | I would suggest to be consistent with using the term "game" for a sequence of moves and "position" for a board state. I was also confused by the meaning of "overlapping the two games": i thought it meant interleaving the moves of the two games! | |
| Aug 17 at 7:33 | answer | added | Albert.Lang | timeline score: 2 | |
| Aug 15 at 22:13 | history | edited | JKHA | CC BY-SA 4.0 |
added 1 character in body
|
| Aug 15 at 12:46 | comment | added | dan_fulea | Let me type some words, to see if i understood the situation. There are regular moves of two chess games, $A,B$, having the same number $N$ of half-moves, they may be not ended. After these $N$ half-moves we take a new chess board $C$ and teleport all pieces from the boards $A,B$ to their final positions, except for the black $A$-king, and the white $B$-king. There are no collisions of two pieces landing on the same square. This position must be regular, achievable from a normal chess game. Is it so? Well, it may be hard to prove minimality... | |
| Aug 15 at 4:15 | history | asked | JKHA | CC BY-SA 4.0 |