HDTenEightyP/NetNews huggingface dataset:
From: jimhsu@athena.mit.edu (Jimmy M.D. Hsu)
Subject: Re: redundancy
Organization: Massachusetts Institute of Technology
Distribution: na
Date: Sat, 5 Sep 1992 08:21:11 GMT

How about SAT test?

I also thought of Scuba gear, since
apparatus is really gear.
(for those that don't know, Scuba stands for
Self-contained underwater breathing apparatus)

There must be many words like this since
people will say the word as a noun and use the
abbreviation as an adjective, sometimes for the
benefit of people who might not know the term.

--
James Amdee

So, where's my penny??
Newsgroups: rec.puzzles
From: goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard)
Subject: Re: Oxymoron-->New Thread
Organization: Rose-Hulman Institute of Technology
Date: Mon, 14 Sep 1992 13:48:42 GMT


In article <1992Sep13.151354.17002@athena.mit.edu>  
jimhsu@athena.mit.edu (Jimmy M.D. Hsu) writes:
> I was thinking about recent oxymoron postings,
> when I happened to consider the phrase:
> 
> Iambic Pentameter.
> 
> I guess with the laws of probability,
> it's no surprise that it doesn't have the
> correct number of syllables!
> 
> But notice how the word 'prefix'
> has a prefix with it!
> 
> *******************************************
> My question is:  What are some other words
> that are self-descriptive like this?  That
> is, the word contains its definition or has
> an implicit concept which is its meaning?
> *******************************************

PENTASYLLABIC.


bart
From: rmurphy@usc.edu (Bob Murphy)
Newsgroups: rec.puzzles
Subject: redundancy
Date: 4 Sep 1992 16:46:59 -0700
Organization: University of Southern California, Los Angeles, CA
Distribution: na
NNTP-Posting-Host: aludra.usc.edu

One can sometimes overhear people use the following phrases:

    ATM machine, HIV virus, PIN number, and LCD display.

These are all redundant.  For example, ATM stands for Automatic
Teller Machine so why say the word "machine" after ATM?  The others
are similar.  Can anyone think of other examples of this type of
redundancy?

                             Bob Murphy (rmurphy@aludra.usc.edu)

Newsgroups: rec.puzzles
From: cliff@watson.ibm.com (cliff)
Subject: Puzzle 1
Date: Mon, 14 Sep 1992 13:37:41 GMT
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Organization: A

Title: Cliff Puzzle 1: Can you beat the numbers game?
From: cliff@watson.ibm.com
 
If you respond to this puzzle, if possible please include your name,
address, affiliation, e-mail address.  If you like, tell me a little bit
about yourself.  You might also directly mail me a copy of your response
in addition to any responding you do in the newsgroup.  I will assume it
is OK to describe your answer in any article or publication I may write
in the future, with attribution to you, unless you state otherwise.
Thanks, Cliff Pickover
 
* * *
At a recent trip to the Ontario Science Center in Toronto, Canada I came
across an interesting puzzle.  The center is located minutes from
downtown Toronto and it's a vast playground of science with hundreds of
exhibits inviting you to touch, try, test, and titillate your curiosity.
The puzzle I saw there can be stated as follows.  In the 10 boxes below,
write a 10-digit number.  The digit in the first box indicates the total
number of zeros in the entire number.  The box marked "1" indicates the
total number of 1's in the number.  The box marked "2" indicates the
total number of 2's in the number, and so on.  For example, the "3" in
the box labeled "0" would indicate that there must be exactly three 0's
in the 10-digit number.
 
-------------------------------
| 0| 1| 2| 3| 4| 5| 6| 7| 8| 9|
| 3|  |  |  |  |  |  |  |  |  |
-------------------------------
 
 
Stop And Think
 
1. Is there a solution to this problem?  Are there many solutions to this
problem?
 
2. A more advanced an interesting problem is to continue to
generate a sequence in a recursive fashion such that each row becomes
the sequence for the previous.  For example, start with the usual
0 through 9 digits in row 1:
 
Row 1: 0 1 2 3 4 5 6 7 8 9
 
Assume Row 2 is your solution to the puzzle.  I've just inserted random
digits below so as not to give away the solution:
 
 
Row 1: 0 1 2 3 4 5 6 7 8 9   S(1)
Row 2: 9 3 2 3 3 1 6 7 8 9   S(2)
Row 3:                       S(3)
 
Row 2 is now the starting point, and your next job is to form row 3, row 4,
etc. using the same rules.  In the previous example, a digit in the
first box would indicate how many 9's there are in the next 10-digit number,
and so forth.
 
Contest: I am looking for the longest sequence of numbers users can come
up with using these rules.  Can you find a Row 2 or Row 3?
Is it even possible to generate a "row 2" or "row 3"?
 
Newsgroups: rec.puzzles
From: onar@hsr.no (Onar Aam)
Subject: The ULTIMATE problem!!!
Organization: Rogaland University Centre
Date: Mon, 14 Sep 1992 14:55:05 GMT


I challenge you lot out there to solve this problem. If you crack this nut, you
qualify for Mensa-membership. I posted this problem to rec.org.mensa as well, and
no-one dared to answer it. Do YOU dare????


THE PROBLEM:

A very bright and sunny Day
The Priest didst to the Verger say:
"Last Monday met I strangers three
None of which were known to Thee.
I ask'd Them of Their Age combin'd
which amounted twice to Thine!
A Riddle now will I give Thee:
Tell Me what Their Ages be!"

So the Verger ask'd the Priest:
"Give to Me a Clue at least!"
"Keep Thy Mind and Ears awake,
And see what Thou of this can make.
Their Ages multiplied make plenty,
Fifty and Ten Dozens Twenty."

The Verger had a sleepless Night
To try to get Their Ages right.
"I almost found the Answer right.
Please shed on it a little Light."
"A little Clue I give to Thee,
I'm older than all Strangers three."
After but a little While
The Verger answered with a Smile:
"Inside my Head has rung a Bell.
Now I know the answer well!"


Now, the question is:

How old is the PRIEST??
               ======


Clues that you need to know: It IS possible to solve this problem. It's not a
joke. Also: all ages are WHOLE-numbered. And finally: if you find the age of the
priest, you will also find the ages of the strangers and, of course, the verger.

I will post more clues in a few days if no-one replies.


                          Onar.
Newsgroups: rec.puzzles
From: cfarmer@ncsa.uiuc.edu (Chuck Farmer)
Subject: Please repost logic puzzles
Followup-To: rec.puzzles
Organization: NCSA
Date: Wed, 9 Sep 1992 00:05:10 GMT

Could someone please repost the original On the Cards and Playful Kittens
logic puzzles. I lost my copies in a machine crash. (I know about backing
up but it happened before my BU time). I would prefer email but can get
them off the net.



Thanks
Chuck
cfarmer@ncsa.uiuc.edu


Only a fool is sure - Moe Howard
Newsgroups: rec.puzzles
Subject: 20 question stories
From: rossw@ccu1.aukuni.ac.nz (Ross Williamson)
Date: Mon, 7 Sep 1992 05:36:57 GMT
Organization: University of Auckland, New Zealand.

	I'm looking for a collection of logic puzzles.
What they are is a story which you can tell people and then they ask
you questions about the problem trying to solve the question you 
pose them.  Similar to 20 questions but these can last for days ie.

	' There is a man in a desert he is hung by his neck from a
gallows.  His feet are 5 feet off the ground there is no way he could
have got to this position by jumping or climbing.  All you notice is
that there is a puddle of water at his feet.
	Question : How did he die ??  '

	And then people ask questions like 
	'Did he climb the gallows to the noose?'
	To which the answer is 
	'no'

	Is there a list of these around they are alway a good laugh and
a lot of fun to do.
	
	Does someone want to try and solve this one ??

Please help me :)

Ross
+-----------------------------------------+--------------------+
| Name   : Ross Williamson                |Auckland University | 
| E-Mail : rossw@ccu1.aukuni.ac.nz        |    New Zealand     |
| Of course these opinions are my own and thank !! for that    |
+--------------------------------------------------------------+
"Oh Zaphod he's in his cabin signing photos of himself, 'To 
myself with frank admiration" Arthur Dent - From the Hitchhikers
Guide To The Galaxy.

Newsgroups: rec.puzzles
From: spencer@dew.Princeton.EDU (S. Spencer Sun)
Subject: 2,3,4,5,6,7,8,9,10 and series
Reply-To: spencer@phoenix.princeton.edu (S. Spencer Sun)
Organization: Live Organ Transplants
Date: Sat, 5 Sep 1992 20:31:20 GMT

Of course, another solution is

	2, 3, 4, 5, 6, 7, 8, 9, 10, 3628811.

If f(n) = n + (n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)(n-8)(n-9)(n-10).

The idea can be extended easily.

(I think this was in Discover a looooong time ago.  Sorry if it's an
FAQ)

----------- The opinions expressed in this article are solely mine. -----------
<Insert lame attempt at disclaimer humor>
sss/PU'94 Dept of CS (spencer@phoenix.princeton.edu)/JvNCnet (spencer@jvnc.net)
Roses are red, violets are blue / Some poems rhyme, and some don't.
From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Newsgroups: rec.puzzles
Subject: Re: 4 color atlas
Date: 8 Sep 92 18:26:15 GMT
Reply-To: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Organization: The Wistar Institute of Anatomy and Biology
In-reply-to: karr@cs.cornell.edu (David Karr)

In article <1992Sep1.185224.25875@cs.cornell.edu>, karr@cs (David Karr) writes:
>I believe it was proved by computer in the late 70s.

1976.

>						       That is to say,
>a group of people wrote a computer program that printed out reams of
>paper that purported to be a proof of the theorem.

This is a silly and somewhat insulting description of what happened.

>						     The reason the
>proof is so long is that many, many cases must be considered.

As far as we know, that is correct.  There may be some other proof.

>There was (and I think still is) some controversy about this proof
>method because supposedly no human being has ever been considered
>to truly have understood and verified the proof.  It is simply
>too long.

The controversy was pretty much ridiculous, made possible by people
not knowing anything about computers having mouths.  Such people are
getting rarer and rarer in the mathematics community.
-- 
-Matthew P Wiener (weemba@sagi.wistar.upenn.edu)
Newsgroups: rec.puzzles
From: chalcraft@uk.tele.nokia.fi (Adam Chalcraft)
Subject: Re: 4 color atlas
Organization: cpd
	<4efukvG00VpNJ4DY1L@andrew.cmu.edu>
	<1992Sep11.042521.21615@cs.cornell.edu>
Date: Fri, 11 Sep 1992 07:17:14 GMT

In article <1992Sep11.042521.21615@cs.cornell.edu> karr@cs.cornell.edu (David Karr) writes:

>   >took only a few minutes each to fix, and one missed case, which took a
>					     ^^^^^^^^^^^^^^^
>   >solid afternoon's work and one more computer run to cover.
>
>   The missing case would really bother me if it were my program.  I 
>   wonder why it was missing, and what makes them so sure now that
>   there aren't yet OTHER missing cases that human readers could not
>   pick out from the 460 pages of results?
>
>   As weused to say at work, "I've fixed the last bug" is never a true
>   statement when talking about any substantial program.
>
>   (Yes, there are methods of reasoning about whether programs match
>   specifications, and one might be able to check the spefication by hand
>   to verify that it really was the 4-color problem, but were these
>   techniques known in 1977?  I'm curious.)

Okay, for the last time.
The proof is not a 1-liner saying "here's the program, read the output", and
the computer made a few mistakes. Think about how you might go about writing
the program. You can't just enumerate all planar graphs, you have to have some
way of throwing away infinitely many in one go before you can get anywhere.
The paper is actually some good pure maths, introducing the concepts of
unavoidable sets of configurations and "discharging" of potential around the
graph. Without the help of a lot of simplifying theorems, the output would
have been *much* larger, and not feasible at all. It was a simplifying step
which missed a case, not the computer.
--
  ____________________________________________________________________________
 /  _Name: Adam|Names are linguistic constructs expressed in some language._  \
|\_|/|Chalcraft|They correspond to objects in some universe of discourse. |\|_/|
|`   |         |The corresponence between names (in the language) and     |`   |
|`   |Opinions:|objects (in the universe of discourse) is the relation of |`   |
|`   |     Mine|identifying. A name identifies the object to which it is  |`   |
|`   |_________|bound.__________________________ISO_7498-3_:_1989_(E)_5.1_|`   |
 \__/                                                                      \__/
From: jmkaraka@eos.ncsu.edu (JOHN MARTIN KARAKASH)
Newsgroups: rec.puzzles
Subject: Re: 20 question stories
Date: 9 Sep 92 23:07:20 GMT
Reply-To: jmkaraka@eos.ncsu.edu (JOHN MARTIN KARAKASH)
Organization: North Carolina State University, Project Eos
Originator: jmkaraka@c00088-100lez.eos.ncsu.edu


> 
|> 	I'm looking for a collection of logic puzzles.
|> What they are is a story which you can tell people and then they ask
|> you questions about the problem trying to solve the question you 
|> pose them.  Similar to 20 questions but these can last for days ie.
|> 
|> 	' There is a man in a desert he is hung by his neck from a
|> gallows.  His feet are 5 feet off the ground there is no way he could
|> have got to this position by jumping or climbing.  All you notice is
|> that there is a puddle of water at his feet.
|> 	Question : How did he die ??  '
|> 
|> 	And then people ask questions like 
|> 	'Did he climb the gallows to the noose?'
|> 	To which the answer is 
|> 	'no'
|> 
|> 	Is there a list of these around they are alway a good laugh and
|> a lot of fun to do.
|> 	
|> 	Does someone want to try and solve this one ??
|> 
|> Please help me :)
|> 
|>
 
	I don't know of a source but I have a couple you might like:

1) he died because he didn't see the sawdust

2) John and Linda are dead.  There is glass and water on the floor.

	You notice how a lot of these puzzles have corpses in them!

	If anyone wants to play, I'll only post the yes/no replies rather than
the situation.

	-john 'not just another tom, dick, or harry' karakash-
From: srw@horus.ps.uci.edu (Steven White)
Subject: Re: Idle Minds (circle chopping)
Newsgroups: rec.puzzles
Reply-To: srw@horus.ps.uci.edu (Steven White)
Organization: University of California, Irvine
Date: 11 Sep 92 03:07:28 GMT

In article <mrios.7291@meltdown.chi.il.us>, mrios@meltdown.chi.il.us (Michael Rios) writes:
|> Hi everyone.  I was just trying to get to sleep a few nights ago and came up
|> with these.  I have the answers to most of them now, but the later ones elude
|> me.
|> 
|> 1. We'll begin at the beginning.  One straight line can, at best, divide a     
|>   circle into two parts.  Two straight lines can, at best, divide a circle   
|> into four parts.  Three straight lines give, at best, seven parts.  How   
|> about 4 straight lines?  5?  n?

You mean the circle plus its interior, not the circle itself.
A circle can only be divided into 2*n parts.
From: dant@techbook.com (Dan Tilque)
Newsgroups: rec.puzzles
Subject: Multiple spellings
Date: 5 Sep 92 08:25:27 GMT
Article-I.D.: techbook.1992Sep5.082527.15911
Reply-To: dant@techbook.com (Dan Tilque,,,,)
Organization: Pseudopolis Yard

This is an open question, but I can't think of a better place to post it.

What common word has the most different ways of being spelled.  I'm
talking about legitimate spellings which appear in the dictionary (don't
use the net or Dan Quayle as a reference).

I'm not sure what the answer is, but my best guess follows the page
feed.



catercorner

There's eight spellings in Webster's Third.

catercorner
cater-cornered
catacorner
cata-cornered
catty-corner
catty-cornered
kitty-corner
kitty-cornered

If you look in Random House, you will find one more which doesn't appear
in Web3, but it only differs by a hyphen:

cater-corner

---
Dan Tilque    --     dant@techbook.com
Newsgroups: rec.puzzles
From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Newsgroups: rec.puzzles
Subject: Re: Multiple spellings
Date: 8 Sep 92 19:17:55 GMT
Reply-To: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Organization: The Wistar Institute of Anatomy and Biology
In-reply-to: steppe@ccwf.cc.utexas.edu (Top Changwatchai)

In article <79322@ut-emx.uucp>, steppe@ccwf (Top Changwatchai) writes:
>First name:  Muammer, Moammar, Muammar
>Last name:  Qaddhafi, Qaddafi, Gaddafi, Kaddafi, Khadafy, Qadhafi, Qadaffi,
>  Gadaffi, Qathafi, Gadaafi, and, in Adams' words,

When he got bombed years back, and the discussion broke out in many
places, someone posted a regexp that got all the variants and little
else for the sake of KILL files.  Anyone still have it?  Or better,
want to figure it out again?
-- 
-Matthew P Wiener (weemba@sagi.wistar.upenn.edu)
From: steppe@ccwf.cc.utexas.edu (Top Changwatchai)
Newsgroups: rec.puzzles
Subject: Re: Multiple spellings
Date: 8 Sep 92 04:26:59 GMT

In article <1992Sep5.082527.15911@techbook.com> dant@techbook.com (Dan Tilque,,,,) writes:
>This is an open question, but I can't think of a better place to post it.
>
>What common word has the most different ways of being spelled.  I'm
>talking about legitimate spellings which appear in the dictionary (don't
>use the net or Dan Quayle as a reference).
>...
>Dan Tilque    --     dant@techbook.com

This is only tangentially related, but in Cecil Adams' _Straight_Dope_ column
he mentions various spellings for Moammar Gadhafi's name, as found in assorted
publications:

First name:  Muammer, Moammar, Muammar
Last name:  Qaddhafi, Qaddafi, Gaddafi, Kaddafi, Khadafy, Qadhafi, Qadaffi,
  Gadaffi, Qathafi, Gadaafi, and, in Adams' words,
"...the Library of Congress and the Middle East Studies Association, to whom
one would ordinarily look for guidance, have an unaccountable fondness for
Qadhdhafi, which is an abomination unto God."

I heartily agree with this assertion.

Top

PS  The article (collected in Adams' _More_of_the_Straight_Dope_) goes on to
mention that the colonel himself once wrote a letter to some American
-- 
steppe@ccwf.cc.utexas.edu
"I'm gonna live forever or die trying."
From: meza@techlaw.ogi.edu
Newsgroups: rec.puzzles
Subject: Re: redundancy
Date: 11 Sep 92 22:56:25 GMT
Article-I.D.: techlaw.1992Sep11.225625.5282
Organization: MARGER JOHNSON McCOLLOM & STOLOWITZ Inc, Portland OR

In article <1992Sep10.092316.1@emu.insted.unimelb.edu.au>  
edwardsp@emu.insted.unimelb.edu.au (Paul Edwards) writes:
> >>One can sometimes overhear people use the following phrases:
> >>
> >>    ATM machine, HIV virus, PIN number, and LCD display.
> >>
> >>These are all redundant.  For example, ATM stands for Automatic
> >>Teller Machine so why say the word "machine" after ATM?  The others
> >>are similar.  Can anyone think of other examples of this type of
> >>redundancy?
> >>
> 
> 	MIDI interface?
> 
> Paul
> edwardsp@insted.unimelb.edu.au

	FET transistor

PJM
meza@techlaw.com
Newsgroups: rec.games.chess
From: haefner@IASTATE.EDU (Ralph I Haefner)
Subject: Re: Fischer-Spassky - Game 4 - the mistake
Keywords: New World Champion
Reply-To: haefner@IASTATE.EDU (Ralph I Haefner)
Organization: Iowa State University
Date: Mon, 7 Sep 1992 22:09:01 GMT

In article <palane.715900547@vincent2.iastate.edu>, palane@iastate.edu (Paul A.
Lane) writes:
> A battle does not make a war, a game does not make a match, an olive does not
> make a martini . . .
> 

Once again my fellow cyclone is way off the mark.  The point is that Fischer
wants to be considered World Champion.  For this to be legitimate he would
have to play Kasparov.  And the only way to force Kasparov into playing him
is to so decisively defeat Spassky that there is no question Fischer deserves
the shot.  The current score  +1 -1 =2 does nothing to show Fischer is 
deserving of a chance to play Kasparov.

Ralph
Xref: sparky rec.games.chess:6990 gnu.chess:386
From: rs@sys.uea.ac.uk (CHE Guest News Login)
Newsgroups: rec.games.chess,gnu.chess
Subject: FAQ about Computer Chess..Buying Guide
Date: 7 Sep 92 10:03:07 GMT
Organization: UEA School of Information Systems, Norwich, UK.

Hello Friends,
	Is there an FAQ about this list. If so, can any one mail me the same or alternatively answer my following query:

I am interested in buying a Computer Chess. I would like to know the difference
between Chess software used on IBMs or Table Top / Travel Chess Computers available in the market.

Will any one of you can give me an idea of some cheap & best option available
in all the three categories, i.e., Table Top Chess / Travel Chess / Chess Software.

All the responses will be duly thanked and acknowledged.

Dr Rakesh Sarin
rs@uk.ac.uea.sys
Newsgroups: rec.games.chess
From: bwatkins@nyx.cs.du.edu (The God of all machines)
Subject: Re: Fischer's next opponent
Organization: University of Denver, Dept. of Math & Comp. Sci.
Date: Wed, 9 Sep 92 00:58:21 GMT


Anatoly Karpov might be an appropriate rival for Fischer, after all,
they should have played in 1975!  Perhaps, right after Spasski's rematch...

Newsgroups: rec.games.chess
From: bwatkins@nyx.cs.du.edu (The God of all machines)
Subject: Re: Spassky's Breyer
Organization: University of Denver, Dept. of Math & Comp. Sci.
Date: Sat, 5 Sep 92 01:13:36 GMT


don't you mean  
1. e4  c5??
?

Newsgroups: rec.games.chess
From: rhs@world.std.com (Richard H Schwartz)
Subject: Re: Prononciation Of Names
Organization: The World Public Access UNIX, Brookline, MA
Date: Mon, 14 Sep 1992 15:11:39 GMT

ath@linkoping.trab.se (Anders Thulin) writes:

>In article <1152@mwuk.UUCP> tony@microware.co.uk (Tony Mountifield) writes:

>> And how do you pronounce Euwe as in Dr. Max Euwe?

>Should apparantly be pronounced as 'ervour' in 'fervour'.

I recall reading a comment 15 or so years ago that was attributed to 
some GM (can't remember who it was, or where I read it):

  "I pronounce it 'Oy Vei', because whenever I have to 
   play against him that's what I say."

-rich
-- 
             Richard H. Schwartz, Scheduling Systems Inc.,
            1000 Massachusetts Avenue, Cambridge, MA  02138
                  (617) 864 8330; FAX (617) 864 8377
                          rhs@world.std.com
From: dsteele@almaden.ibm.com
Newsgroups: rec.games.chess
Subject: Re: F-S II gossip - game 8 analysis
Date: 14 Sep 92 21:28:13 GMT
Reply-To: dsteele@almaden.ibm.com ()


  David Fry posts 

|> 
|> From Spassky's side we hear that he is having problems with his 
|> concentration.  "The problem is the fifth hour, that is when my 
|> concentration drops," he said.  Spassky's 31. Rc1 in game 8 was 
|> judged a good move by Robert Byrne and Deep Thought II in the New 
|> York Times, to which Fischer answered 31....Ncb3? 32. axb3 Nxb3. But 
|> Spassky followed up with the awful 33.Rc6? rather than 33.Rc3 which 
|> would have given him all the winning chances.

   Can anyone explain this? It doesn't look so obvious that 33 Rc3 
   gives Spassky winning chances. 
   
              Dave         dsteele@almaden.ibm.com
From: ben@wharf.UUCP (Bob Fischer)
Newsgroups: rec.games.chess
Subject: F-S game 5  0-1
Date: 9 Sep 92 15:57:21 GMT
Organization: Fisherman's Wharf BBS  (215) 383-7245

Game 5  09/09/92
Fischer-Spassky     0-1
[E95 Ruy Lopez, Breyer variation]
1.e4 e5 2.Nf3 Nc6 3.Bb5 a6 4.Ba4 Nf6 5.0-0 Be7 6.Re1 b5 7.Bb3 d6 8.c3 0-0
9.h3 Nb8 10.d4 Nbd7 11.Nbd2 Bb7 12.Bc2 Re8 13.Nf1 Bf8 14.Ng3 g6 15.Bg5 h6
16.Bd2 exd4 17.cxd4 c5 18.d5 Nb6 19.Ba5 Nfd7 20.b3 Bg7 21.Rc1 Qf6 22.Rb1
b4 23.Ne2 Qe7 24.a3 bxa3 25.Bc3 f5 26.Bxg7 Qxg7 27.Nf4 fxe4 28.Nh4 g5
29.Ne6 Qf6 30.Qg4 Nxd5 31.Nxg5 hxg5 32.Qxd7 Nb4 33.Qxb7 Nxc2 34.Rxe4 a2
35.Rf1 Nb4 36.Rg4 a1Q 37.Rxa1 Qxa1+ 38.Kh2 Qg7 39.Qf3 Qe5+ 40.g3 Rf8
41.Qg2 Qf6 42.f4 Ra7 43.Rxg5+ Rg7 44.Rh5 Qe6 45.g4 Rxf4 White resigns


+--+       ben%wharf@canal.org                 | yes, Bob Fischer        +--+
+--+--+    uunet!cbmvax!gvlv2!lock60!wharf!ben | is my real name!     +--+--+
   +--+--+                                     | No,               +--+--+   
Aiko  +--+ Fisherman's Wharf BBS (215)383-7245 | I'm just a phish  +--+  aikO
   
Newsgroups: rec.games.chess