Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 17, 2021 at 15:11 | comment | added | ophact | @tsh: I think it makes it more interesting, and more accurate as well as we are producing "more real" algebraic notation. I agree about ambiguities, but in the opening I decided that there would be no "disambiguation", partly because I'm not very familiar with the topic myself. | |
Sep 17, 2021 at 3:24 | comment | added | tsh | I know a little about chess, and no nothing about algebraic notation before. I'm confused that won't this cause ambiguous? Also, "check" and "checkmate" makes this challenge too complex, imo. | |
Sep 13, 2021 at 10:50 | comment | added | emanresu A |
What about, say, Nf4 d5 Ng1 , with backtracking, and that's the only way to make it valid?
|
|
Sep 13, 2021 at 10:26 | comment | added | ophact | @emanresuA This is "simple" algebraic notation, in the sense that any more complex types of moves are not considered. I'm not much of a chess expert myself. | |
Sep 13, 2021 at 10:24 | history | edited | ophact | CC BY-SA 4.0 |
added 215 characters in body
|
Sep 13, 2021 at 10:24 | comment | added | emanresu A | Not a dupe, but a lot more complex than it seems. Also, there are several ways to get to one position, and some involve backtracking - for example, how would an algorithm know how to get to a position with one black pawn advanced two squares? | |
Sep 13, 2021 at 10:21 | history | answered | ophact | CC BY-SA 4.0 |