HDTenEightyP/NetNews huggingface dataset:
From: dcrosgr@uoft02.utoledo.edu
Newsgroups: rec.games.chess
Subject: Re: Pardon Fischer?
Date: 29 Dec 92 08:52:02 EST
Organization: University of Toledo, Computer Services

In article <1992Dec29.045247.21763@midway.uchicago.edu>, hau4@ellis.uchicago.edu (sven  hauptfeld) writes:
> In article <1992Dec28.104417.683@uoft02.utoledo.edu> dcrosgr@uoft02.utoledo.edu writes:
>>In article <1992Dec28.045856.13741@midway.uchicago.edu>, hau4@ellis.uchicago.edu (sven  hauptfeld) writes:
>>> In article <1hcu7eINN2s6@parsifal.umkc.edu> chris@kasey.umkc.edu (Christopher Mitchell) writes:
>>>>
>>>>Though I view Bobby Fischer as somewhat of an American asset
>>> 
>>> Perhaps you should view it as an American burden.
>>> 
>>He has contributed more to the country than you have...
>>
>>But, that is just my belief. Tell us Sven, what HAVE you given the U.S.?
>>
> How about taxes?   ;-)
> 
> 	Sven
> 

Gee, the Government holds a gun to your head, extracts money, and you consider
it a contribution???

That's like saying you contributed to a mugger! ;-)
From: hau4@ellis.uchicago.edu (sven  hauptfeld)
Newsgroups: rec.games.chess
Subject: Re: Pardon Fischer?
Date: 3 Jan 93 02:34:52 GMT
Reply-To: hau4@midway.uchicago.edu
Organization: University of Chicago

In article <1992Dec31.164624.757@uoft02.utoledo.edu> dcrosgr@uoft02.utoledo.edu writes:
>
>Gee! Maybe Bush should have paid Fischer $5 million to have the match here so
>he could have been re-elected.
>
Chess wouldn't work - not popular enough. But another sport, like basketball,
might. But that would be illegal use of campaign funds (and $5M wouldn't be
enough to get the top players anyway).

	Sven
Newsgroups: rec.games.chess
From: jrb@Ingres.COM (John Black)
Subject: Re: Volga/Benko Gambit help
Organization: Ingres, an ASK Company, Alameda CA 94501
Date: 4 Jan 93 02:33:12 GMT

In article <1993Jan3.022526.13137@vela.acs.oakland.edu> tewald@argo.acs.oakland.edu writes:
>My first submission/question:
>I am white in the following:
>1.d2-d4  g8-f6  2. c2-c4  c7-c5  3. d4-d5 b7-b5  4. b2-b3 ...
>MCO12 identifies black's 3rd move with the Benko Gambit.  It gives three
>possible responses:  4.c4xb5  4. g1-f3  4. a2-a4
>
I'm not a Benko player, so I won't try and describe why these moves are more
often seen in high-level play than your move, but I can give you the one and
only line given in "The Complete Benko Gambit" by GM Fedorowicz:

4. b3 bxc4  5. bxc4 d6  6. Nc3 g6  7. Bb2 Bg7  8. f3 Nbd7  9. e4 Rb8 with a
slight edge for Black; Masera-Benko, Reggio Emilia 1970/71.

john//
Newsgroups: rec.games.chess
From: phr@telebit.com (Paul Rubin)
Subject: Re: It is legal to play chess in Yugoslavia
Organization: Telebit Corporation; Sunnyvale, CA, USA
	<1992Dec23.120510.617@uoft02.utoledo.edu>
Date: 23 Dec 92 12:43:54

    > Obligatory chess question:  Does there exist a chess position in
    > which Black has enough material to mate White in theory, but Black
    > cannot mate White even with White's cooperation, while on the other
    > hand White can mate Black without Black's cooperation?

    No. If it can be proven that black cannot mate white even with white's
    cooperation, then it is impossible in theory for black to mate white.

    The two situations can not co-exists in our universe using our logic.

This is an issue of semantics.  The question asked about when
black has *enough material* to mate White, meaning there are
positions where Black could mate White with that material; however,
this does not have to be one of those positions (and Black can't
be able to reach such a position even with White's cooperation).

For example, I think it is normally possible to mate with KBB vs. K.
But if both Bishops are on the same color squares (through
pawn promotion), mating might not be possible--I haven't thought
about it enough to be sure.
From: dubach1@husc10.harvard.edu (joev dubach)
Newsgroups: rec.games.chess
Subject: Re: TO THE GM's/IM's FROM DON
Date: 21 Dec 92 13:34:31 GMT
 <1h18d1INN188@agate.berkeley.edu><1992Dec20.101509.578@uoft02.utoledo.edu> 
 <34463@rnd.GBA.NYU.EDU><1992Dec20.233336.585@uoft02.utoledo.edu>
Organization: Harvard Arts and Sciences Computer Services, Cambridge, MA
In-reply-to: dcrosgr@uoft02.utoledo.edu's message of 21 Dec 92 04:33:36 GMT

In article <1992Dec20.233336.585@uoft02.utoledo.edu> dcrosgr@uoft02.utoledo.edu writes:

>My personal philosophy on life can be boiled down to:

>A working imperfect solution is better than a non-working perfect solution.

>I have little respect for 'critics' who lack the ability to climb to the top,
>and it spills over....

Mmm-hmm.  I take it you have little respect for yourself, then.

Joev
--
_____________________________________________________
DDDDDDDDD   JJJJJJ      | Joev Dubach
     D      J     J     | dubach1@husc.harvard.edu
     D      J     J     | 249 North Mail Center
D    D      J     J     | Harvard University
DDDDD    *  JJJJJJ  *   | Cambridge, MA 02138
Newsgroups: rec.games.chess
From: dcrosgr@uoft02.utoledo.edu
Newsgroups: rec.games.chess
Subject: Re: To (mostly) all; Sven especially.
Date: 30 Dec 92 12:53:20 EST
Organization: University of Toledo, Computer Services

In article <19022@mindlink.bc.ca>, Bruce_Harper@mindlink.bc.ca (Bruce Harper) writes:
> I still don't think dmc knows how to play chess.  I think he and Sven should
  ^^^^^^^^^^^^^^^^^^^
  BINGO!

> have a match on the net, so we can all watch.  I would miss the brilliant and
> compelling advocacy which we have all come to love, but I for one would be
> willing to make that sacrifice.

Oh Christ. What next? You'll claim someone is giving me the moves.

Admit it bucko, you stepped right into a massive pile of horseshit when you made
you 'expertly reasoned' claim I couldn't play. And now, rather than admit to
the world you fucked up, yor diggin in deeper. Reminds me of those lawyers
who take a beating when the other side does a killer direct, so on cross they
stand up and ask the exact same questions...

Har har har. I bet, if you are stupid enough to actually do litigation, your
batting average is well below .500.

But, since you are SOOOO certain, I'll make you a wager. I fly out to where
you are, and play YOU in a game of chess. 

Loser pays for the roundtrip tickets.

So Mr. Expert, still believe so strongly in your claim???

> 
> Don't hold your breath, usenet.rec.games.chess readers.  Wasn't it Lasker who
> said "Lies and hypocrisy don't survive on the chessboard?"

Well then, I am SURE you will take up the offer.

> 
> [By the way, there's nothing wrong with asking a question to which you don't
> know the answer - it's asking a question where the answer can hurt you that
> can be dangerous.

And if you haven't learned that ANY answer from an opposing witness can do you
damage, well, I don't know...

Reminds me of a case where a father (with a BAD heart condition) had shot his
son (golden gloves boxer) who had just threatened the father and might have
been coming towards him (disputed testimony). The prosecution asked the father:

"Isn't it true that your son never hit you that night?"

The defendant replied.

"Yes..........if he had, I wouldn't be here right now."

I even heard the judge mutter "ohhhh" to that answer.

   

		   If you become a lawyer some day you'll learn all sorts of
> interesting things - if you keep an open mind.  No charge for the advice.]
> 
> So who's going to be White?

Well, you proposed the match, I am picking the opponent. I think I should be,
but rules may state otherwise.

Newsgroups: rec.games.chess
From: phr@telebit.com (Paul Rubin)
Subject: Re: PAPAL CHESS
Organization: Telebit Corporation; Sunnyvale, CA, USA
Date: 25 Dec 92 13:18:29

G. Koltanowski in "Chessnicdotes" tells a story of trying to get
a game with the Pope when the Pope visited San Francisco.
From: Jeff Boyd <BOYDJ@QUCDN.QueensU.CA>
Newsgroups: rec.games.chess
Subject: Re: 2267 Performance Rating for 10-year old in Montreal
Date: Sun, 3 Jan 1993 01:13:00 GMT
Organization: Chessnews list (chessnews-request@tssi.com)
NNTP-Posting-Host: helios.unl.edu



ashish@tfs.com (Ashish Mukharji) wrote:
>  Does anyone know what became of Jeff and his sister?  I vaguely
>  remember they were removed from the custody of their abusive father
>  ... another "mad dad achieves vicarious glory through kids" story.


>From what I've read about the family, I wouldn't jump to that conclusion
(or any other).  The Children's Aid Society has a history of incompetence
and outright abuse of power in Ontario ... but they also do a lot of
good.  If you are unorthodox in the slightest as a parent, either for or
against your child's benefit, you could lose custody.  The CAS holds a
great deal of power.

Jeff and Julia have claimed all along that they wanted to remain with
their father.  There is a court order in place declaring that neither
child may publicly describe their interactions with the CAS until they
reach the age of consent (18).  And if that doesn't make you afraid of
your government, nothing will.


jeff
From: linb@ucs.orst.edu (Benjamin Lin)
Newsgroups: rec.games.chess
Subject: chess base games format
Date: 1 Jan 1993 05:17:52 GMT
Organization: University Computing Services - OSU
Distribution: world
NNTP-Posting-Host: ucs.orst.edu

could someone please convert the pgn files Mr. Edwards uploaded
to valkyries.andrew.cmu.edu into chess base games format (.cbf
.cbi etc...) and upload them.  Thanks in advance!!!

-benoni

PS I'm farely certain that the KSdemo will load them properly.
From: mginsbur@rnd.GBA.NYU.EDU (Mark Ginsburg)
Newsgroups: rec.games.chess
Subject: Re: US Championship Round 14 GAMES
Date: 21 Dec 92 20:09:14 GMT
Organization: NYU Stern School of Business


Chess question:  why did Rachels refrain from the well-known
9. dxe6 e.p. in his game with Gulko?

Didn't Petrosian lose a hideous game to Tal this way?

I think 9. dxe6 Bxe6 is quite a comfortable edge for white.

Comments?

-mark
From: dcrosgr@uoft02.utoledo.edu
Newsgroups: rec.games.chess
Subject: Re: this has got to stop
Date: 1 Jan 93 13:41:10 EST
Organization: University of Toledo, Computer Services

In article <19100@mindlink.bc.ca>, Bruce_Harper@mindlink.bc.ca (Bruce Harper) writes:
> Agreed.  Even better, don't read any of it, then there's no temptation to
> reply.  (A good New Year's Resolution).

Bruce, in your previous post, you said you were not going to comment anymore.

Looks like you were wrong there too!

DMC

Willing to risk plane fare, no net posting, and a bad haircut for the sake of
further humiliating Harper!

Bruce, don't ya just wish you had not called me a liar?
From: Daniel_Marsalone@agwbbs.new-orleans.LA.US (Daniel Marsalone)
Newsgroups: rec.games.chess
Subject: DMC & this has gotta stop: ENOUGH ALREADY!
Distribution: world
Date: 1 Jan 93 00:56:26 CST
Organization: The Amiga GateWay BBS * New Orleans, La.

 
    I think that if I see one more message about Sven, DMC, or entitled
"this has got to stop", I am going to start killing those who post this
nonsense.
 
    I am very displeased with what I see taking place here. Some messages
are alright (like the one about dumbing down CM3000). However, the majority
are just cal. 

    And if I see another post with the title of "re: Pardon Fischer", Bobby
gets a bullet through his head.


-- Via DLG Pro v0.995

Daniel Marsalone             Daniel Marsalone            Daniel Marsalone
Internet: daniel_marsalone@agwbbs.new-orleans.LA.US
    UUCP: rex!agwbbs!daniel_marsalone

Newsgroups: rec.games.chess
From: Bruce_Harper@mindlink.bc.ca (Bruce Harper)
Subject: Re: Queen's Gambit question
Organization: MIND LINK! - British Columbia, Canada
Date: Sun, 27 Dec 1992 16:13:44 GMT

In a Queen's Gambit Declined the moves ...c6 and ...Bb4 are logically
inconsistent.  I don't think there's much point looking any further.  As
you've pointed out, at best Black gives White the move a3 for free.
Newsgroups: rec.games.chess
From: nnsge01@mailserv.zdv.uni-tuebingen.de (Dale Gerdemann)
Subject: Fischer-Spasskey results (request)
Organization: Comp. Center (ZDV) U of Tuebingen, FRG
Date: Mon, 21 Dec 1992 09:15:48 GMT

Could somebody please send me a transcript of all the games in the
Fischer-Spasskey match? I'd like to get a copy of the games to send to
my nephew as a Christmas present. If someone has a transcript with
commented moves, that would be even better. Thanks.


Dale Gerdemann
Seminar fuer Natuerlich- Sprachliche Systeme
Universitaet Tuebingen
Kleine Wilhelmstr. 113
D-W-7400 Tuebingen, Germany

dg@arbuckle.sns.neuphilologie.uni-tuebingen.de
gerdemann@mailserv.zdv.uni-tuebingen.de

PS: I hope no one flames me. I really don't approve of what Fischer
and Spasskey did, but the games may still be interesting for a
teenager developing an interest in chess.

Newsgroups: rec.games.chess
From: mem@world.std.com (Jeff Lesser)
Subject: Re: MChess Pro vs. ChessMachine
Organization: The World Public Access UNIX, Brookline, MA
Date: Mon, 28 Dec 1992 00:21:40 GMT

ralf@ark.abg.sub.org (R.Stephan) writes:

>uzun@crash.cts.com (Roger Uzun) writes:
>> >- MChessPro vs. ChessMachine Gideon 2.1 (Blitz mode - 60/5'):  8.5 - 1.5
>> >- MChessPro vs. ChessMachine King 1.0   (Blitz mode - 60/5'):  8.0 - 2.0
>> >- MChessPro vs. ChessMachine Gideon 2.1 (Tournament - 60/2h):  6.5 - 3.5
>> >
>> But in Madrid, Chessmachine Schroeder defeated MChess Pro on a 486/66,
>> it is unclear to me that MChess Pro can beat the latest version
>> of The Chessmachine and the Schroeder software, which is its
>> default software, iin any competition with any 80X86 machine,
>> because of the results of the latest world chess championship
>> tournament, where The Chessmachine won, and MChess pro palced 10th,
>> with MChess Pro and the Chessmachine meeting in head to head competion.


>   NOT!!!!  Please check your facts.
>   One CM win in one game is by no means a "defeat".  Here you see 30 games.
>   And more coming...

>   The results of the WCs are not only always doubtful (5 round Swiss),
>   but this one is also rumored to have been manipulated by not pairing
>   correctly (Swiss-wise).

>ralf
>--
>***************
>Sbetrg Pburerag


I agree.  Also, remember that a "486/66" is really a 33 MHz system in all
areas except for the CPU.  The author of MChess thinks that his program is
actually faster on a 486-50DX than on a 486-66DX2.  And, most importantly,
the version of ChessMachine you can buy for $750ish today runs at 15 MHz;
the version that beat MChess Pro (in ONE game) was undoubtedly at least
the upcoming 30 MHz RISC-based one.  These facts, plus the posted test
results, lead one to believe that MChess Pro is still pretty darned
strong.  And just wait till the Pentium chip from Intel...
Newsgroups: rec.games.chess
Subject: Re: 2267 Performance Rating for 10-year old in Montreal
From: pmbarlow@miavx1.acs.muohio.edu (Pete Barlow... 'The Candy Guru')
Date: 3 Jan 93 13:22:54 -0500
Organization: Miami University Academic Computer Service"

In article <1993Jan3.043104.1920@cis.uab.edu>, sloan@cis.uab.edu (Kenneth Sloan) writes:
> In article <1993Jan2.130353.14810@miavx1.acs.muohio.edu> pmbarlow@miavx1.acs.muohio.edu (Pete Barlow... 'The Candy Guru') writes:
>>In article <31DEC92.15661460.0064@VM1.MCGILL.CA>, CCHB@MUSICA.MCGILL.CA (CCHB) writes:
>>> His brother, age 6, wants to play in tournaments too, but is just
>>> learning to write, and cannot record his moves!
>>
>>Easy enough.  If the kids parents are coming along to the tournaments, just
>>have THEM record the moves until the kid is old enough to write for himself. 
>>That'd come under the "appointing a deputy" clause, in the rules for
>>handicapped players section of the ORC, and not knowing how to write would
>>certainly be a valid reason to have someone else record the moves.
> 
> Yes, but...a parent is a particularly poor choice for an assistant.

Mmm... probably.

> And, don't forget that if you allow one player an assistant you must
> allow his opponent an assistant, too.

There IS that, I suppose...

> Hereabouts, it is common to waive the recording requirement for 6yr
> olds.  Even in an "adult" tournament, I suspect that few opponents would
> object, and the lack of a score sheet is not likely to affect the game.
> I'd say go for it - but I would look for scholastic events first. 

We don't have any 6-year-old tournament players in either Dayton or
Cincinnati... in fact, the youngest guy we DO have that plays regularly is
13-year-old USCF Expert Jacob Chudnovsky.

But you've probably got the best idea... waive the recording reqs for the
6-year-olds.  And look primarily for the scholastics.

TCG, pb.
Newsgroups: rec.games.chess
From: Bruce_Harper@mindlink.bc.ca (Bruce Harper)
Subject: Pardon me...
Organization: MIND LINK! - British Columbia, Canada
Date: Thu, 24 Dec 1992 21:12:55 GMT

Well, it seems clear (in view of the pardons today) that the American
President does have the power to pardon before conviction.  I don't think
Fischer got one of the Christmas presents, though...
From: seh@neutron.physics.arizona.edu (Steven E. Hoell)
Newsgroups: rec.games.chess
Subject: Re: A game of chess with dmc!?
Date: 31 Dec 92 17:11:49 GMT
Distribution: na
Organization: University of Arizona, Tucson AZ

In addition to the plane fare and loser-leave-net
conditions, the stakes should include a bad haircut
for the loser (as is often done in professional
wrestling).

A recent issue of _Chess Chow_ ran a picture of
Brutus "The Barber" Beefcake on the cover.
Good work, Mark!



Seasons Beatings,

Steve Hoell		seh@neutron.physics.arizona.edu
Xref: sparky rec.games.chess:11833 rec.puzzles:8080 comp.unix.shell:5125
From: anw@maths.nott.ac.uk (Dr A. N. Walker)
Newsgroups: rec.games.chess,rec.puzzles,comp.unix.shell
Subject: Re: A puzzle for Christmas
Date: 21 Dec 92 18:23:36 GMT
Reply-To: anw@maths.nott.ac.uk (Dr A. N. Walker)
Organization: Maths Dept., Nott'm Univ., UK.

In article <1992Dec18.200400.19070@maths.nott.ac.uk> I wrote:
>While at a conference recently, I picked up a neat little sliding-block
>puzzle with a chess theme.
[...]
>	If you want to construct [the solution] yourself, "unshar" the files
>below into some unused directory, and type "run".  [...]
>While "run" is running, there is also a large database, which grows to
>around 19 meg;  this has to be sorted, so another 19 meg is needed, total
>44+ meg.

	Thanks to Andy Walker, anw@maths.nott.ac.uk, for pointing out that
this database and its sorted version are completely unnecessary, as I knew
at one stage and had forgotten.  In a sliding-block puzzle with a bipartite
graph and in which all moves are reversible, those positions which are
first reached in N moves are exactly those which are obtained by playing
one move from those first reached in N-1 moves and stripping those which
are first reached in N-2;  there is no need to strip also those first
reached in N-4, N-6, ....

>	On a Silicon Graphics workstation, the "run" script takes around
>1h45m to complete;

	The revised version [below] runs in 13 minutes instead, and is
probably fast enough even on a Sparc or a PC not to need re-coding in C;
also, only 6M of storage, instead of 44M, is needed.  Replace the version
of "run" given in the original shell archive by the one below the "snip"
line.

-- 
Andy Walker, Maths Dept., Nott'm Univ., UK.
anw@maths.nott.ac.uk

====8<========8<========8<========8<========8<========8<========8<========8<===

#! /bin/sh

# This file is Copyright 1992 A. N. Walker, anw@maths.nott.ac.uk
#	Permission is hereby granted to use it freely for academic or
# private purposes, provided that this notice is retained and any changes
# noted in versions made available to other people.

case $1 in
    [0-9]*) nn=$1 ;;
     *) echo kBWB:BWFW:KBDD:EWBW 1 D0 > l0 2> l-1
	nn=0
esac

nminus=`expr $nn - 1`
while test -s l$nn
do	nplus=`expr $nn + 1`
	generate l$nn l$nminus l$nplus
	compress l$nminus
	nminus=$nn
	nn=$nplus
done
Newsgroups: rec.games.chess
From: jmh@athena.mit.edu (J Michael Hammond)
Subject: Re: 2267 Performance Rating for 10-year old in Montreal
Organization: Massachusetts Institute of Technology
Date: Sun, 3 Jan 1993 15:02:52 GMT

In article <1993Jan3.043104.1920@cis.uab.edu> sloan@cis.uab.edu
(Kenneth Sloan) writes:
>>In article <31DEC92.15661460.0064@VM1.MCGILL.CA>,
CCHB@MUSICA.MCGILL.CA (CCHB) writes:
>>> Ten-year old Lefong Hua scored an impressive 3.5 out of 5 in the
>>> Open section of a tournament in Montreal (Canada) which ended
>>> yesterday...
[some deletion]
>My guess (Elliott!  break out the historical database and embarass me!)
>is that a 10yr old with a published, established, Expert rating is very
>exceptional, but not unknown...

If you do break out the database, Elliott, could you look up two kids
from Minneapolis: Jamie Wheat and his younger sister Erin?  Back in
1990 they both played regularly at the chess club in Minneapolis, I
think Jamie was nine and Erin seven.  Jamie was already an A player at
that time and Erin either had broken or was bearing down on 1400.  I
moved out of the area in early 1991 and haven't seen or heard much of
the Minneapolis chess scene since.

Unlike other notable examples, their parents seem to be quite
reasonable.  Mr. Wheat took up tournament chess about the same time as
the kids and seemed quite happy to learn from both of them.
From: dcrosgr@uoft02.utoledo.edu
Newsgroups: rec.games.chess
Subject: Re: A game of chess with dmc!?
Date: 30 Dec 92 17:44:10 EST
Organization: University of Toledo, Computer Services

In article <19028@mindlink.bc.ca>, Bruce_Harper@mindlink.bc.ca (Bruce Harper) writes:
> What an astounding idea - it never occurred to me.  I trust you - and I don't
> want to meet you - so why not play on the net right now?  You can take White
> (that means you go first).

Sure, I'll gladly play you--except for one thing. This came up as a result of
your (ignorant) refusal to believe I could play chess. (I fail to see what that
has to do with my posts, since I am not commenting on the games themselves, but
I am sure in your mind it all makes sense...somehow...). Now, could you please
enlighten me as to HOW a few posts a week with some game will PROVE I know how
to play chess?

Besides bucko, if you trusted me, as you have just stated, you would trust I
know how to play.

You are contradicting yourself in an attempt to draw attention away from the
fact you lack the BALLS to back up your claim that I don't know how to play the
game. (As was determined by your superior reasoning ability from non-existant
clues.)

> 
> But there should be some stakes - how about the loser doesn't post on the net
> for a year?

How about the ones I posted? Loser pays plane fare.

Don't worry, as a succesful litigator, I am sure you could afford the loss.
I'll make it easy on you--I'll even fly coach.


> 
> dmc    "Mr. Expert"*
> 1. ?
> 
> While I can't imagine a future lawyer cheating by getting advice, I'm willing
> to take the chance that someone like Benjamin might kibitz...

Oh Christ! You claim to be a lawyer, and you can't imagine a future one
cheating???

Is there anyone out there who actually believes lawyers are honest and ethical
people?

I sure as hell don't.

Which is why the terms you affer are worthless. How do I know YOU will not
cheat? How do I enforce the bargain when you lose. (Or, how do you enforce it
when I lose?)

Further, a possibility you have failed to see (or at least state) is that I
might know how to play and STILL lose. What then?

Nah, let's make it FUN! Let's COMBINE our wagers! Lose pays plane fare AND
stays off of the net for one year.

Do you accept, or do you decline?

> 
> 
> *Actually this should be "Mr. Master", but technicalities never bothered me.
> 
> This should be a fun tournament.  Your play!

I have made my offer, you lack the chutzpah to accept.


> 
> [Sven - wait your turn].

And, Sven, you will have to wait a LONG time--as my potential opponent is
scurrying for cover.

You know Bruce, my original post to you was correct--you ARE making for good
sport.

Have a nice day.