Article View: sci.logic
Article #415Re: "Solvability" in Chess
From: Lars Roennow
Date: Tue, 29 Sep 1992 09:49
Date: Tue, 29 Sep 1992 09:49
13 lines
1212 bytes
1212 bytes
In article <1992Sep25.205258.25317@cs.rochester.edu> fulk@cs.rochester.edu (Mark Fulk) writes: >Actually, the FIDE rules go a bit farther: if there have been 50 moves >without a capture, the game is drawn unless one player can demonstrate a >forced mate (this allows the use of the KBN vs. K mate). Are you sure ? It is well known that KBN vs K is a forced mate in about 37 moves (worst). But anyone have the right to test your opponents technique. Therefore I am nearly sure thet one have to demonstrate a mate *within* the 50 moves. /ronnow
Technical Details
Message-ID:
<RONNOW.92Sep29094939@kuhn.iesd.auc.dk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!dkuug!iesd!iesd.auc.dk!ronnowReferences:
<1992Sep25.013439.1019@cbnewsl.cb.att.com> <1992Sep25.185626.14074@ugle.unit.no> <1992Sep25.205258.25317@cs.rochester.edu> <1992Sep28.025846.7309@ucsu.Colorado.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!dkuug!iesd!iesd.auc.dk!ronnow From: ronnow@iesd.auc.dk (Lars Roennow) Newsgroups: sci.logic,sci.math,rec.games.chess Subject: Re: "Solvability" in Chess Message-ID: <RONNOW.92Sep29094939@kuhn.iesd.auc.dk> Date: 29 Sep 92 09:49:39 GMT References: <1992Sep25.013439.1019@cbnewsl.cb.att.com> <1992Sep25.185626.14074@ugle.unit.no> <1992Sep25.205258.25317@cs.rochester.edu> <1992Sep28.025846.7309@ucsu.Colorado.EDU> Sender: news@iesd.auc.dk (UseNet News) Organization: Mathematics and Computer Science, Aalborg University Lines: 13 In-Reply-To: cuffell@spot.Colorado.EDU's message of 28 Sep 92 02:58:46 GMT