Article View: sci.logic
Article #393Re: "Solvability" in Chess
From: CUFFELL TIMOTHY MICH
Date: Mon, 28 Sep 1992 02:58
Date: Mon, 28 Sep 1992 02:58
10 lines
1073 bytes
1073 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). Isn't there another modification of the 50 move rule, for K+N+N v. K+P, where the pawn doesn't have time to promote, but prevents the stalemate in K+N+N v. K? Anyone have specifics?
Technical Details
Message-ID:
<1992Sep28.025846.7309@ucsu.Colorado.EDU>Path:
arc1-ca.pugleaf.net!sparky!uunet!boulder!ucsu!spot.Colorado.EDU!cuffellReferences:
<1992Sep25.013439.1019@cbnewsl.cb.att.com> <1992Sep25.185626.14074@ugle.unit.no> <1992Sep25.205258.25317@cs.rochester.edu>Show Full Headers
Complete Article Headers
Newsgroups: sci.logic,sci.math,rec.games.chess Path: arc1-ca.pugleaf.net!sparky!uunet!boulder!ucsu!spot.Colorado.EDU!cuffell From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH) Subject: Re: "Solvability" in Chess Message-ID: <1992Sep28.025846.7309@ucsu.Colorado.EDU> Sender: news@ucsu.Colorado.EDU (USENET News System) Nntp-Posting-Host: spot.colorado.edu Organization: University of Colorado, Boulder References: <1992Sep25.013439.1019@cbnewsl.cb.att.com> <1992Sep25.185626.14074@ugle.unit.no> <1992Sep25.205258.25317@cs.rochester.edu> Date: Mon, 28 Sep 1992 02:58:46 GMT Lines: 12