Article View: sci.logic
Article #410Re: "Solvability" in Chess
From: -Broadband Network Maintenance
Date: Mon, 28 Sep 1992 23:54
Date: Mon, 28 Sep 1992 23:54
10 lines
886 bytes
886 bytes
There is talk about chess being a 0 sum game, win loss, or draw. No fooling! Of course we could award points at the end of the game based on the value of pieces left, P=1, B = 3, ect. Winning the game would need a value. If you win a game you would be awared the winning value plus points for the pieces. Or the K may be assigned points, . . . you get the idea. --Bruce
Technical Details
Message-ID:
<12627@sail.LABS.TEK.COM>Path:
arc1-ca.pugleaf.net!sparky!uunet!zephyr.ens.tek.com!sail!tcmaintReferences:
<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
Path: arc1-ca.pugleaf.net!sparky!uunet!zephyr.ens.tek.com!sail!tcmaint From: tcmaint@sail.LABS.TEK.COM (-Broadband Network Maintenance) Newsgroups: sci.logic,sci.math,rec.games.chess Subject: Re: "Solvability" in Chess Message-ID: <12627@sail.LABS.TEK.COM> Date: 28 Sep 92 23:54:43 GMT References: <1992Sep25.014035.1269@cbnewsl.cb.att.com> <1992Sep25.015013.1780@cbnewsl.cb.att.com> <xeno.717471510@pv34ad.vincent.iastate.edu> Followup-To: sci.logic Organization: Tektronix, Inc., Beaverton, OR. Lines: 10