Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/5/84; site sunybcs.UUCP Path: utzoo!watmath!sunybcs!ugfailau From: ugfailau@sunybcs.UUCP (Fai Lau) Newsgroups: net.games.chess Subject: Re: Re: Re: Perfect Play? Message-ID: <2951@sunybcs.UUCP> Date: Tue, 18-Mar-86 07:41:46 EST Article-I.D.: sunybcs.2951 Posted: Tue Mar 18 07:41:46 1986 Date-Received: Wed, 19-Mar-86 04:01:04 EST References: <2916@sunybcs.UUCP> <978@ism780c.UUCP> <2950@sunybcs.UUCP> Distribution: net Organization: SUNY/Buffalo Computer Science Lines: 31 > > > > Since the white queen always has at least fourteen moves, and at most > > ........ >> > > Let white include at least two checks in the above series. Then white > > will have a higher score than black, but still have a won game. Let both > > sides then switch to perfect play, and white will win with a higher score. > > > > -- > > Tim Smith sdcrdcf!ism780c!tim || ima!ism780!tim || ihnp4!cithep!tim > > This is a perfect case to illustrate what I mentioned in my follow > up to the original article. In this example it is clear that Black > .......... > (not necessary the worst) move strategy to force Black to make the > best (which may often be the only legal) move in every response. > It seems that I posted the previous article in a hurry, without looking at the end game situation carefully. The basic philosophy is the same, however. The case was actually that Black was helping White to increase his score by not making his best move which would be to take the queen. With queen's many move options, White could pile up his points with ease. +-----------------------------------------------------------------------------+ | Fai Lau | | ECE / CS SUNYAB | | BI: ugfailau@sunybcs | +-----------------------------------------------------------------------------+