HDTenEightyP/NetNews huggingface dataset:
From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH)
Subject: Re: Youngest GM/IGM?
Organization: University of Colorado, Boulder
Date: Fri, 2 Oct 1992 06:32:15 GMT

In article <Sep.30.19.17.39.1992.2550@remus.rutgers.edu> clong@remus.rutgers.edu (Chris Long) writes:
>In article <1992Sep30.123340.15972@husc3.harvard.edu>, David Fry writes:
>
>> Fischer became a GM in 1958 (or he earned his title then, maybe it was
>> awarded later), and is the youngest.  I think Judit Polgar earned her
>> GM title before she was 16 as well, but I guess she was still older
>> than Bobby.
>
>No, Judit Polgar is the youngest ever, followed by Fischer, followed
>by Kasparov.  I'm not sure who the fourth is, perhaps Michael Adams.
>-- 
>Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618

As I understand it, there is some descrepancy about who was the youngest
GM.  Seems that Judit is the youngest to qualify, but Fischer was the
youngest to actually be bestowed the title.  Something about how FIDE
grants titles all a specific time each year, rather than as you earn them.
They went out of their way to give Fischer the title early, because a 15
year old GM was such a big deal back then.  I don't remember where I heard
this.  Does anyone have more details?

Newsgroups: rec.games.chess
From: cuffell@spot.Colorado.EDU (CUFFELL TIMOTHY MICH)
Subject: Re: mirror, mirror on the board...
Organization: University of Colorado, Boulder
Date: Tue, 29 Sep 1992 08:34:31 GMT

In article <Sep.26.18.30.11.1992.2404@thorogood.rutgers.edu> miklas@thorogood.rutgers.edu (Keith Miklas) writes:
>suppose that you are playing a novice who is quite an inexperienced
>chessplayer.  He knows that you are a superior player, and decides to
>mirror each and every one of your moves.  What's the best strategy to
>play against this person?
>
>(ps don't play the stonewall! :)

How about:

1. P-KR4	P-KR4
2. P-KN4	P-KN4
3. RPxP		RPxP
4. RxR		????

You are a rook up, and he can't mirror any more.
From: mkukkone@klaava.Helsinki.FI (Mika Kukkonen)
Newsgroups: rec.games.chess
Subject: Re: Budapest gambit
Date: 6 Oct 92 17:06:04 GMT
Organization: University of Helsinki

In <1992Oct6.145616.1237@magnus.acs.ohio-state.edu> mzabel@magnus.acs.ohio-state.edu (Mark A Zabel) writes:

[beginning deleted to shorten other people's suffering, and to eliminate
non-chess discussion. If you want to flame me, mail me.]

>The Fajarawicz is dangerous at some levels because there are
>some lines which lead to very aggressive black piece placements.
>These lines depend upon White making a mistake-at least to some
>degree.  It is dubious at best at GM level.  I would be willing
>to bet that there aren't any GMs in the world who would avoid
>playing 1.d4   2.c4 because Black could play the Fajarawicz.
>

Firstly, I just wanted to post those games, as someone mailed to me and
asked for them. There are allready too much talking and too little moves
in this newsgroup. Your post just happened to be last on this topic. But
don't worry, I have your name now on my kill file :-)

Secondly, as I sense some literalism here, may I point that the name is 
Fajarowicz, not Fajarawicz.

It seems that we are having different viewpoints here. You are thinking
from low-rated level, and I am thinking in serious competition level. At
low level you can play anything (hey, I even lost few blitz games in ICS
where black answered my "solid" 1.c4 with ultraviolent 1.-b5?!). But
that does not mean you should. Sure, you may get few easy points, but
overall you are walking on very thin ice. Why have the trouble? There
are many active defences to 1.d4 + 2.c4 (KI, Benoni) that can't be
outright classified as "bad".

Mika
-- 
Mika Kukkonen = Mika.Kukkonen@Helsinki.FI
Trying to learn to live in Helsinki University of Computer Science.
"I am studying, so I am, or am I (studying)?"
Newsgroups: rec.games.chess
From: "lisa powell" <lisa.powell@canrem.com>
Subject: query
Reply-To: "lisa powell" <lisa.powell@canrem.com>
Organization: Canada Remote Systems
Distribution: rec
Date: 28 Sep 92 12:16:50 EST

Having a problem finding a good line for black in the Sicilian Najdorf
where white plays 6.Bc4. Gufeld doesn't mention it. ECO B90 6 & 7 has
slim pickings for black with 6..Nbd7 and 6.. g6. IM Joe Gallagher's
Trends, chapter 3, shows 4 games: 3 wins for white and 1 draw -- about
which IM JG writes: "an absolutely fascinating game which White was
unlucky not to win."

As I see it: two possibilities: either there's a
book out there somewhere that shows some hope for black, or the Najdorf
is dead meat for black. Which is it?

Internet: lisa.powell@canrem.com . CRS . 71036,36 Compuserve
   
 * PMDBM  V1.75b #3 *
--
Canada Remote Systems  - Toronto, Ontario
World's Largest PCBOARD System - 416-629-7000/629-7044
From: wp01jst1@ucsbuxa.ucsb.edu (John Tomas)
Newsgroups: rec.games.chess
Subject: Re: O'Kelley and L. Day Books
Date: 28 Sep 92 21:11:49 GMT


The Day "book" really is just the reproduced articles from the original
*Modern Chs Theory*.  I got a copy from APCT (Jim and Helen Warren's
postal organization).

Newsgroups: rec.games.chess
From: LIPSCOJA@ctrvax.vanderbilt.edu ()
Subject: Re:  Chess FAQ
Organization: Vanderbilt University 
Date: Thu, 1 Oct 1992 03:32:57 GMT
X-News-Reader: VMS NEWS 1.21

One correction to the FAQ needs to be made:  FIDE now awards Woman FIDE
Master (WFM) as well.

BTW, is there any pairing software out there (esp. available over the net)?

Andy Lipscomb
lipscoja@ctrvax.vanderbilt.edu
From: v5875bza@ubvmsd.cc.buffalo.edu (Michael M Gorman Jr)
Newsgroups: rec.games.chess
Subject: Re: solvability and the end of the universe
Date: 4 Oct 92 21:43:00 GMT
Organization: University at Buffalo
News-Software: VAX/VMS VNEWS 1.41

In article <1992Oct3.224734.28586@midway.uchicago.edu>, hau4@midway.uchicago.edu writes...
>In article <BvHyCz.94A@acsu.buffalo.edu> v5875bza@ubvmsd.cc.buffalo.edu (Michael M Gorman Jr) writes:

>>The point is:  given an infinite time to think about it, is
>>chess solvable.  That's the only interesting question.  Whether
>>there will actually be enough time to do it is a bore.
>>
>>MG
> 
>Completely wrong. Infinity has nothing to do with it. Chess is solvable in
>FINITE number of steps.
> 
>	Sven

I'm not sure we disagree on this.  If it's solvable, then it's solvable
in a finite number of steps.  But some people want to say:  the universe
will end before you go that number of steps.  My point is that that
sort of limitation is irrelevant.  When we do math, we don't bother
about such insignificant things as the end of the universe.  By
"given an infinite amount of time", I mean:  "Give the solver as much
time as s/he needs."  The fact that the solver may
need more time than there is left in the universe doesn't matter.
But to confuse that with the sort of infinite series business in
calculus and so forth is a mistake on my part.  Thanks!

MG
From: tennis@ziff.com
Newsgroups: rec.games.chess
Subject: Re: Living World Champions
Date: 28 Sep 92 20:44:24 EDT
Organization: Ziff-Davis, Medford MA

In article <1992Sep24.192121.27556@magnus.acs.ohio-state.edu>, jmumaw@magnus.acs.ohio-state.edu (John C Mumaw) writes:
>      Euwe is dead, I'm sure Botvinnik is dead, but Tal is still alive, isn't 
> he?
> 
>                                        -John Mumaw (1804)
Mikhail Tal, 1936-1992 (Chess Life October cover story)

:(
:(
:(

Tony Ennis
From: mrosen@csd4.csd.uwm.edu (Michael David Rosen)
Newsgroups: rec.games.chess
Subject: Re: F-S Match, ratio wins/draws. WHY?
Date: 2 Oct 1992 03:20:57 GMT
Organization: Computing Services Division, University of Wisconsin - Milwaukee
Distribution: world
NNTP-Posting-Host: 129.89.7.4

Fischer's ratio of wins/draws is normally very high. The reason is this: He 
plays to win in virtually every game. Fischer scored over 77% of his points
in the period 1970-1972. 71 wins; 37 draws; 7 losses.

Also, the fact that there are no adjournments removes the common strategy of
avoiding uncertain continuations when nearing time control. The contestants
can't retire to their quarters with an entourage of GMs to analyse the 
position for the best line.

Newsgroups: rec.games.chess
From: ccecks@nuscc.nus.sg (Chua Kong Sian (Mr))
Subject: Re: GNU Chess Site
Organization: National University of Singapore
Distribution: usa
Date: Fri, 2 Oct 1992 00:58:07 GMT

lee@zeta.kpc.com (On Lee) writes:
: Where can I ftp GNU chess ?
: Thank you for your help.

There are probably sites than this, but I know of two.  One of course is
at prep.ai.mit.edu (which stores lots of GNU stuff) and the other is at
valkyries.andrew.cmu.edu (which stores anything to do with chess).


.sig?  What .sig?
Newsgroups: rec.games.chess
From: John.Risk@bbs.oit.unc.edu (John Risk)
Subject: Chess games upperbound
Organization: Extended Bulletin Board Service
Date: Sat, 3 Oct 1992 05:42:32 GMT

This somewhat follows the solvability thread.  I began to wonder how many
games are possible.  I looked at upperbounds to compute this,
understanding that the actual number is most certainly less.

1) A game is drawn after 50 move pairs without a pawn push or a capture.
Since there are at most 96 pawn moves (6x16) and 30 captures, the maximum
numbers of moves (not move pairs) is (50x2)(96+30)=12600 moves

2) The number of choices to move are K=8, Q=27, R=14, B=13, K=8, rook pawns=2,
other pawns=3 (accounting for capturing) (Also ignoring moving 2 on first
move, since that would reduce the number of possible pawn moves in
paragraph 1.)   This totals 127 maximum (clearly this diminishes as pieces
are captured, and is usually much less because of lines being blocked.)

3) The upper bound of the number of possible chess games is 127**12600=
some pretty good sized number, but finite. In round numbers that is a 1
with 25000 zeros after it. (About the size of the national debt!) :->

John

--
   The opinions expressed are not necessarily those of the University of
     North Carolina at Chapel Hill, the Campus Office for Information
        Technology, or the Experimental Bulletin Board Service.
           internet:  bbs.oit.unc.edu or 152.2.22.80
From: mazzarel@spam.berkeley.edu (Ariel Mazzarelli)
Newsgroups: rec.games.chess
Subject: Re: Gone fishing
Date: 3 Oct 1992 21:32:36 GMT
Organization: U.C. Berkeley Math. Department.
NNTP-Posting-Host: spam.berkeley.edu

In article <1aj9lfINNmjb@uwm.edu> jgd@csd4.csd.uwm.edu writes:
>Question: I've seen the term "fish" (or in one case, "phish") used,
>	  apparently as a reference to a relatively unskilled method of
>	  play.  My question is, "what is the etymology of this term?"
>	  Why say someone 'played like a fish'?  Why not 'dodo', or
>	  <fill in the blank here>?
>
>	  I'm looking for the history and derivation of this particular
>	  usage.  And, while you're at it, I would not refuse a good,
>	  concise definition of "fish" in this context.

Well the expression is at least 20 years old,  and it was never properly
explained to me--although it was pretty obviously not a flattering description
of one's play.  The best I've been able to deduce after all this time is
that one of the things that fish do is take the bait.  Of course,  some fish
are actually sharks--e.g. Korchnoi.

Ariel
From: elkies@ramanujan.harvard.edu (Noam Elkies)
Newsgroups: rec.games.chess
Subject: Mates on infinite board (Re: a different variant)
Date: 29 Sep 92 16:24:53 GMT
Organization: Harvard Math Department

[no longer x-posted to sci.math]

In article <1992Sep29.104211.6272@cbnewsl.cb.att.com>
ed@cbnewsl.cb.att.com (edward.m.hummel) writes:

>Mate can be forced with KRRvK, KRBBvK, KBBBBvK.  Mate cannot be forced
>with KBBBvK.

How will you get KBBBvK, let alone KBBBBvK, in a real game?  (And in
the latter case does it depend on color distribution?  Of course if all
four B's move on like-colored squares there is no mate, even on a
finite board, but what about a 3-1 split?)

>An interesting case is KRBNvK.  I haven't found a sequence
>that forces mate, yet.

I think it's possible: first confine the K to six squares with
Rb7,Be4,Nf3; then to three with Kd4; then to d6&e6 by covering f6
with the Knight; then to c6&d6 by shifting the B to c8; then
Nd8+,Kd6; Rd7#.

Another interesting case is KRRvKB.  White can't go directly
for the KRRvK mate because that requires zugzwang and the Bishop
can play waiting moves to Pluto.  So the question is can the
Bishop be captured, either by a double attack involving mate
threats or by arranging ladder checks (Ra1,K2; Rb2+,K3; Ra3+,K4; etc.)
so that the Rooks reach the Bishop before the King reaches the Rooks?

What about KQNvK and KQBvK ?

--Noam D. Elkies
Newsgroups: rec.games.chess
From: tusk@daimi.aau.dk (Martin M|ller Pedersen)
Subject: Re: Chess FAQ list
Organization: DAIMI: Computer Science Department, Aarhus University, Denmark
Date: Wed, 30 Sep 92 23:28:01 GMT

From rec.games.chess Tue Sep 29 15:06:52 1992
Newsgroups: rec.games.chess,news.answers
From: shauck@adobe.com (Bill Shauck)
Subject: rec.games.chess FAQ: Table of Contents
Followup-To: poster
Keywords: chess FAQ semimonthly answers
Supersedes: <chess-faq-toc_715338902@adobe.com>
Reply-To: shauck@adobe.com
Organization: Adobe Systems Incorporated
Date: Tue, 15 Sep 1992 09:17:39 GMT
Expires: Fri, 2 Oct 1992 09:15:03 GMT

Archive-name: chess-faq/part0

[0] Prologue
------------
[1] Last Revision
-----------------
[2] The United States Chess Federation (USCF)
---------------------------------------------
[3] Chess Federation of Canada (CFC)
------------------------------------
[4] American Chess Foundation (ACF)
-----------------------------------
[5] Federation Internationale des Echecs (FIDE)
-----------------------------------------------
[6] Ratings
-----------
[7] How Ratings are Calculated: USCF Rating, Simplified
-------------------------------------------------------
[8] Tournaments
---------------
[9] The Swiss Tournament Pairing System
---------------------------------------
[10] Recommended Books for Novices/Intermediates
------------------------------------------------
[11] I'm a Novice (or Intermediate).  How Do I Improve?
-------------------------------------------------------
[12] Recommended Openings and Opening Books for Novices and Early Intermediates
-------------------------------------------------------------------------------
[13] Publications
-----------------
[14] Where to Get Books and Equipment
-------------------------------------
[15] State and Local Organizations (USA)
----------------------------------------
[16] Correspondence Organizations
---------------------------------
[17] Bulletin Board Systems (BBS's)
-----------------------------------
[18] E-Mail Games, ICS, Mailing Lists, Usenet reader
----------------------------------------------------
[19] Material Available via Anonymous FTP
-----------------------------------------
[20] Chess-Playing Computers and Software
-----------------------------------------
[21] Database Software
----------------------
[22] Utility Software
---------------------
[23] Trivia
-----------
[24] Variants
-------------
[25] Disclaimer
---------------
[26] Copyright
--------------

-- 
William R. Shauck                       Internet: shauck@adobe.com
Adobe Systems, Inc.            uucp: ...!{decwrl|sun}!adobe!shauck
From: Bruce_Harper@mindlink.bc.ca (Bruce Harper)
Newsgroups: rec.games.chess
Subject: Re: F-S II game 13 (analysis)
Date: 1 Oct 92 23:43:51 GMT
Organization: MIND LINK! - British Columbia, Canada
Distribution: world

Analysis of sorts.  My apologies to Boris for my earlier lack of faith.
Newsgroups: rec.games.chess
From: ace3@quads.uchicago.edu (AA Acero (Tony))
Subject: Re: Uploaded to valkyries.andrew.cmu.edu
Followup-To: rec.games.chess
Summary: better make that GIICS 1.41 :-)
Keywords: GIICS, ICS
Reply-To: ace3@midway.uchicago.edu
Organization: University of Chicago Computing Organizations
Date: Sat, 26 Sep 1992 22:44:51 GMT

A bug slipped out in 1.4 -- so look for 1.41;

all the same features, warnings and suggestions apply.

tony


-- 
Anibal Antonio Acero (tony) | University of Chicago | `To baldly to go where
ace3@quad.uchicago.edu      | 5640 S. Ellis Ave.    |  no one has gone before'
(312)702-8214 (lab)         | James Franck Inst 340 |  what Patrick Stewart
(312)702-8387 (office)      | Chicago, IL 60637     | _should_ be saying
Newsgroups: rec.games.chess
From: hwr@intercal.com (Hanon W. Russell)
Subject: Sidney Bernstein Correspondence
Organization: Chessnews list (chessnews-request@tssi.com)
Date: Tue, 29 Sep 1992 01:21:44 GMT


The death of the legendary Sam Reshevsky overshadowed the
passing of another great American master, Sidney Bernstein.
Thanks to the generosity of IM Walter Shipman, the Russell
Collection recently acquired the following letter from
Bernstein to Shipman. We present it here along with the
game Shipman had sent to Bernstein.

(#7237)
From: Sidney Bernstein
To: Walter Shipman
Date: June 11, 1979

Dear Walter:

Thanks for the game vs Williams. It is tremendous - You should 
publish it. A smashing attack  la Tchigorin or Spielmann. And 
you had the courage to give him e5!! Absolutely splendid!

Joe may be interested in the play after adjournment (my game vs 
Lawson).

Position:
White: Kb7, Nc5, a6
Black: Kd8, Nc8

66 N-R4 (sealed) N-Q3ch 67 K-N8 N-K1? (it really doesn't matter) 
68 P-R7 N-B2 69 N-B5 N-R1 70 K-N7 N-B2 71 N-K6ch Resigns

(Note my change from algebraic notation!)

Looking forward to seeing you (all 3 of you?) My brother & my nephew 
will play, and no doubt the 3 Costigans!) at the W.O. (and 
perhaps the Int'l?)

Best Wishes,
Sid

[This is the game Bernstein was referring to]:

Walter Shipman (2374) Alan Williams (2295) Marshall Grand Prix 
June 2, 1979 1 d4 Nf6 2 g3 g6 3 Bg2 Bg7 4 e4 d6 5 Nc3 O-O 6 Nge2 
Nbd7 7 h3 c5 8 d5 Rb8 9 a4 b6 10 O-O a6 11 g4 h5 12 g5 Ne8 13 f4 
b5 14 ab5 ab5 15 f5 b4 16 Nb1 Ne5 17 Nf4 Nc7 18 Nh5 gh5 19 Qh5 
Nb5 20 Rf4 Nd4 21 Rh4 Re8 22 g6 fg6 23 fg6 e6 24 Qh7 Kf8 25 Rf4 
Nf5 26 de6 Re6 27 Rf5 Rf6 28 Bh6 Bf5 29 Bg7 Ke7 30 ef5 Rf5 31 
Be5 Ke6 32 Nc3 de5 33 Ra6 Rb6 34 Rb6 Qb6 35 g7 1-0

Copyright 1992 Hanon W. Russell
All Rights Reserved
Newsgroups: rec.games.chess
From: LIPSCOJA@ctrvax.vanderbilt.edu ()
Subject: Re: Standardized Notations for Xiangqi
Organization: Vanderbilt University 
Date: Tue, 29 Sep 1992 21:35:45 GMT
X-News-Reader: VMS NEWS 1.21

In <BvCnEF.425@news.orst.edu> linb@ucs.orst.edu writes:

> what are the +,-,= for?  so if my first move is right elephant to right edge,
> is my move E++== (?)
> what if I wanted to centralize an elephant? What would the notation be?
> E++== could also be moving left elephant to center.
> I assume coordinates are used for identifying the piece being moved.
> They should also be used for the target square.
> Coordinates would be 1-9 for files, and a-j for ranks.
> so left elephant to center would be Ea3c5 or simply E35
> since that could only be one move.

Actually, coordinates are not used in xiangqi notation. A move is generally
indicated by: piece letter, file of departure, +/-/=, and file of arrival.
In numbering the files, 1 is at the far right of the player whose piece is
moving.  Since a piece moving vertically can move to many squares on its own
file, its notation is letter, file, +/-, and distance moved.
Examples (from the opening position):
left elephant to center          E7+5
right elephant to center         E3+5
right cannon to central file     C2=5
right cannon forward as far 
     as possible                 C2+4
center soldier forward           S5+1
center soldier left              S5=6
 
> What about notation for Siamese (bughouse) chess?
> I heard about a magazine about Siamese chess.  What notation
> do they use for that? If a standardized form is developed,
> a Siamese Chess Server would be possible.

To record an OTB game would be essentially impossible, since their is no
pattern between the boards (one table might make 5 moves in a row).
But for a server, It would be sufficient for each player to send in moves in
any of the normal notations, with provisions for drops.

In algebraic, one could simply give the move normally, with a $ used as x
is for captures, e. g. R$e2 means rook drops on e2. For pawns, either $e2
or P$e2 would do.

Similarly, in descriptive, $ would just replace - in a drop-move [or is it
drop$move? :)]

In numeric, drops would have a 0 for the first digit.  The second would be
1=Q, 2=R, 3=B, 4=N, and 5=P (all but 5 are last digits of pawn promotions
as well); and the last two would be the square of the drop.

Andy Lipscomb
lipscoja@ctrvax.vanderbilt.edu
From: ath@linkoping.trab.se (Anders Thulin)
Newsgroups: rec.games.chess
Subject: Re: Endgame Oddity
Date: 5 Oct 92 14:10:15 GMT
Organization: Telia Research AB, Teknikringen 2B, S-583 30 Linkoping, Sweden

In article <1992Oct3.184229.23291@midway.uchicago.edu> schiller@sapir.uchicago.edu writes:

>Yes, there is a Guiness book of Chess Records.

The book is probably:

	Ken Whyld: Chess - The Records

published by Guiness.

  It's not really like 'Guiness Book of Records', since it does not
concentrate on the biggest, the smallest, the longest etc. There are a
few oddments that seem to have been added at the request of the
publisher (the longest game, the oldest WCh, and things like that).

  Apart from that it's a decent collection of tournament crosstables
and short biographical info - a sort of mini-Gaige.

  Highly recommended for people with inclinations towards chess history.
-- 
Anders Thulin       ath@linkoping.trab.se 	013-23 55 32
Telia Research AB, Teknikringen 2B, S-583 30 Linkoping, Sweden
Newsgroups: rec.games.chess
Subject: Re: Chess is not solvable
From: schiewer@pa881a.inland.com (Don Schiewer)
Date: 29 Sep 92 12:04:14 CDT
Organization: Inland Steel Company, East Chicago, IN
Nntp-Posting-User: ostrowski

In article <cek8TIW2ATvuR1gkRq@pitt.edu>, Teri A Meyers <tasst2+@pitt.edu> writes:
> 
> of possible variants).  A machine which conducts a search for a win X number
> of ply (whether 10 ply or a zillion) will never find it if the game is a
> draw from the position where it begins its analysis (such as before move
> one).  However, when can the machine stop its analysis and declare the
> position conclusively a draw?  However many ply it goes, it finds the
> position a draw, but how  does it know it will not find the win by searching
> one ply further?  It will have to search to infinity.  If it ever did
> get to infinity (which by definition is impossible), could it then supply

This cannot happen because there are theoretical limits on the number of
moves which can be made in chess (ie. 50 move rule, redundant moves, etc.)

When (IF!) a computer follows ALL moves to a draw condition (easily tested)
then it will pick a move at random.

It will continue to do this hoping an error is made on the other side. 

-- 
Don Schiewer   | Internet  schiewer@pa881a.inland.com    | Onward Great
Inland Steel   | UUCP:     !uucp!pa881a.inland!schiewer  | Stream...
Newsgroups: rec.games.chess
From: epstein@rene.ma.utexas.edu (Paul Epstein)
Subject: chinook-tinsley
Organization: University of Texas at Austin Mathematics
Distribution: rec
Date: Wed, 30 Sep 1992 19:32:28 GMT

What happened in this world championship checkers match?
From: wp01jst1@ucsbuxa.ucsb.edu (John Tomas)
Newsgroups: rec.games.chess
Subject: Re: F-S Match, ratio wins/draws. WHY?
Date: 2 Oct 92 16:54:39 GMT


Suggesting that the FS match has a large percentage of wins because F
always plays for wins begs the question, I think.  Kasparov also plays
for a win with Black, yet he has a much higher % of draws in his matches
than is occurring here.

Newsgroups: rec.games.chess