Article View: sci.logic
Article #439Re: "Solvability" in Chess
From: Michael Schmahl [Black-Robe Mage...
Date: Thu, 01 Oct 1992 20:39
Date: Thu, 01 Oct 1992 20:39
11 lines
1113 bytes
1113 bytes
Lars Roennow writes > > 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). Actually, there are a few positions which allow extensions to the 50-move rule, since the quickest forced mate is longer than 50 moves. An example is K+N+N vs K+P.
Technical Details
Message-ID:
<1992Oct1.203935.5382@raven.alaska.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!sun-barr!ames!elroy.jpl.nasa.gov!sdd.hp.com!uakari.primate.wisc.edu!usenet.coe.montana.edu!news.u.washington.edu!raven.alaska.edu!newsReferences:
<RONNOW.92Sep29094939@kuhn.iesd.auc.dk>Show Full Headers
Complete Article Headers
Newsgroups: sci.logic Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!ames!elroy.jpl.nasa.gov!sdd.hp.com!uakari.primate.wisc.edu!usenet.coe.montana.edu!news.u.washington.edu!raven.alaska.edu!news From: fsmgs@camelot.acf-lab.alaska.edu (Michael Schmahl [Black-Robe Mage]) Subject: Re: "Solvability" in Chess Message-ID: <1992Oct1.203935.5382@raven.alaska.edu> Sender: news@raven.alaska.edu (USENET News System) Nntp-Posting-Host: darkhorse.acf-lab.alaska.edu Organization: University of Alaska Computer Network References: <RONNOW.92Sep29094939@kuhn.iesd.auc.dk> Date: Thu, 1 Oct 1992 20:39:35 GMT Lines: 11