![]() First, take note that the longestĦ-man mate took 262 moves (KRN-KNN). Many show interest in what to expect from 8-man endings. The Lemonosov webpage stated as long ago as 2014: We don't know what the answer will be, but there is some intelligent extrapolation possible from existing results. ![]() The real breakthrough will come from tablebase development for the 8-man case. The 7-man case is solved at 549 moves, and ingenuity has pushed this back a few more moves (as of Jan 2021, 535 moves). The answers are very different from a superficially similar SE question where the 50 move-rule is taken into account. These conventions are specifically crafted to support the kind of endgame analysis being discussed in this SE question. Unless expressly stipulated, the 50 moves-rule does not apply to the solution ofĬhess compositions except for retro-problems. This includes 50 moves-rule, but excludes 75 moves-rule. > Relevant for compositional chess are articles 1 to 5, 9.2 and 9.3. Presently the rules defined in the version of the FIDE Laws are valid. The Codex for Chess Problem Compositions states: 50/75 move-rules don't applyįirstly, let's definitively remove one distraction: 50-moves (or 75-moves). It is even conceivable that we already know the longest forced mate in all of chess, which occurs with 7 pieces. Q: How long is the longest forced checkmate in chess?Ī: We will probably never know but the naive extrapolation based on multiplication by number of moves is no longer impossible. While 15% seems like a small subset at first blush, most other piece configurations have large material differences between White and Black so that long lines are unlikely. After generating about 15% of the pawnless endings I’m quite confident to have captured the longest ones. My results suggest that we may already be at or close to this saturation point: the longest winning line for 8-man endgames without pawns appears to be “only” 400 moves. This is worth reading in detail, but one point demands quotation:Īn important question is at what point the chess board becomes so crowded that adding more pieces does not lead to longer winning lines due to the increased likelihood of shortening captures. The main question is at the end of my first paragraph.Įdit: 50 moves without a pawn push or a capture does not trigger a draw.Īn important update on 8-Men Tablebase by Marc Bourzutschky. This question derived from wondering if black or white could win every time from the first move but obviously that isn’t the case. I apologize for the lengthiness of this question, I couldn’t think of a good way to ask what I’m asking. Now, my question is asking what the most amount of moves to guaranteed checkmate is, but you have to take the route to checkmate that has the least amount of moves, so 19 would be the case from the point where the bishop and knight are the only pieces other than the kings left. Now, one set of moves could take say 40 moves to get checkmate from this point, but the least number is say 19 moves away. (there is a way to get checkmate with a bishop a knight, so checkmate is assumed to be guaranteed). Let's assume you are white and have, say, a bishop and a knight left and black is down to just the king. My question is: What is the furthest amount of moves one can be from guaranteed checkmate, when the shortest amount of moves to checkmate is taken? What is the maximum number of moves away from checkmate that a player can be where checkmate is guaranteed? There are many positions that are a guaranteed win for a player if played perfectly, right? (Obviously there is not a guaranteed win from the first move).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |