🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.logic
Article #382

Re: "Solvability" in Chess

#382
From: edward.m.hummel
Date: Sat, 26 Sep 1992 13:25
11 lines
1067 bytes
In article <xeno.717471510@pv34ad.vincent.iastate.edu> xeno@iastate.edu (Gary L Snethen) writes:
>It is not possible for both players to have better than a draw and
>less than a win....  What one player has, the other does not.  One's
>loss is the other's win... zero sum game.
>
>How do I prove this?  The rules of chess state it quite plainly...
>If white wins, black loses.  If black loses, white wins.  A draw is
>considered a perfect 50%/50% game for each (a half-loss, half-win situation).

There is a loop hole:  the rules do not give a value to games that do
not end.
Technical Details
Message-ID: <1992Sep26.132508.24956@cbnewsl.cb.att.com>
Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!uwm.edu!linac!att!cbnewsc!cbfsb!att-out!cbnewsl!ed
References: <1992Sep25.014035.1269@cbnewsl.cb.att.com> <1992Sep25.015013.1780@cbnewsl.cb.att.com> <xeno.717471510@pv34ad.vincent.iastate.edu>

Show Full Headers
Complete Article Headers
Newsgroups: sci.logic,sci.math,rec.games.chess
Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!uwm.edu!linac!att!cbnewsc!cbfsb!att-out!cbnewsl!ed
From: ed@cbnewsl.cb.att.com (edward.m.hummel)
Subject: Re: "Solvability" in Chess
Organization: AT&T
Date: Sat, 26 Sep 1992 13:25:08 GMT
Message-ID: <1992Sep26.132508.24956@cbnewsl.cb.att.com>
References: <1992Sep25.014035.1269@cbnewsl.cb.att.com> <1992Sep25.015013.1780@cbnewsl.cb.att.com> <xeno.717471510@pv34ad.vincent.iastate.edu>
Lines: 12