HDTenEightyP/NetNews huggingface dataset:
From: philip@research.canon.oz.au (Philip Craig)
Subject: Answers to trivia quiz
Organization: Canon Information Systems Research Australia
Date: Wed, 11 Nov 1992 08:55:59 GMT


Here are the answers to the trivia quiz I posted several days ago:

1. A female donkey is called a Jenny. What is a male donkey called?
Jack

2. Marie Antoinette was a Queen of France. Who was her husband?
Louis XVI

3. Musca Domestica is the scientific name for which household pest?
Housefly

4. Which country has a single Cedar tree on its flag?
Lebanon

5. Which form of oxygen derives its name from the Greek meaning "to smell"?
Ozone

6. For which drink is "Mother's Ruin" a nickname?
Gin

7. Which is the largest burrowing Marsupial?
Wombat

8. Who was the Greek Goddess of love and beauty?
Aphrodite

Responders				Scores:
damatt01@starbase.spd.louisville.edu	1
2lau@undergrad.math.uwaterloo.ca	2
msb@sq.com				3
nobby@u.washington.edu			4
jordan@rex.cs.tulane.edu		4
jblake@bingsuns.cc.binghamton.edu	4
morgan@ms.uky.edu			4
dagibbs@quantum.qnx.com			4
mtaranto@shearson.com			5
jmanning@liberty.uc.wlu.edu		5
briang@eng.sun.com			5
schierh@alleg.edu			5
890661B@ace.acadiau.ca			5
rone@koh-sun2.usc.edu			6
mikeb@ocpt.ccur.com			7
KIRBY_DAVE@Tandem.COM			8
-- 
   _/_/_/ _/  _/ _/ _/     _/ _/_/_/ _p_h_i_l_i_p_@_r_e_s_e_a_r_c_h_._c_a_n_o_n_._o_z_._a_u   _--_|\
  _/  _/ _/  _/ _/ _/     _/ _/  _/  Phone: +61 2 805 2951        /      \
 _/_/_/ _/_/_/ _/ _/     _/ _/_/_/   Fax:   +61 2 805 2929        \_.--._/
_/     _/  _/ _/ _/_/_/ _/ _/     PO Box 313 North Ryde 2113 AUSTRALIA  v
Newsgroups: rec.games.trivia
From: jil@uts.uucp (Jamie Lubin)
Subject: Re: rec.games.trivia question
Organization: Bellcore, Piscataway, NJ
Date: Fri, 13 Nov 92 14:40:35 GMT

In article <1992Nov13.142920.19558@murdoch.acc.Virginia.EDU> ckp2n@faraday.clas.Virginia.EDU (Christina Powell) writes:

>Chris

What is the 1st name of the recording artist whose last name is Christian
who recorded I Want You, I Need You, I Love You??
From: blowfish@carina.unm.edu (rON.)
Subject: Movie Trivia, a 3 part quiz. Intro.
Date: Thu, 12 Nov 92 09:41:12 GMT
Organization: University of New Mexico, Albuquerque
Followup-To: sender


I had to just adjudicate a contest between self-proclaimed movie trivia 
whizzes. So I came up with some tough questions. And decided to then
post 'em for your enjoyment.
Mail me your answers, if you want to compare your scores to anybody else
who tries these out.
Its in 3 parts. The first is fairly easy, the second a bit more difficult and
the third is really tough. Good Luck! :)
r. (blowfish@carina.unm.edu)
ps- answers will be posted some time next week)
From: ptaylor@airfarce.Canada.Sun.COM (Peter Taylor - Sun Toronto)
Newsgroups: rec.games.trivia
Subject: THE CANADIAN FLAG
Date: 10 Nov 92 19:18:24 GMT
Reply-To: ptaylor@airfarce.Canada.Sun.COM
Organization: Sun Microsystems, Inc.


A question for the Canadians & flag experts out there.  This has been
bouncing around our office here for the last day or two.

Why were Red & White chosen as the colours for the Canadian Flag back
in '65?

Nobody here can come up with an answer that they could swear by.  Can you?

					Thanks, PKT
___________________________________________________________________________
Peter K. Taylor			|| phone: (416) 477 - 6745  ext. 2302
Sun Microsystems of Canada, Inc.|| fax:   (416) 477 - 9423
 (the best little subsidiary	|| email: ptaylor@airfarce.Canada.Sun.com
	you ever did see!)	||-----------------------------------------
Markham, ON, Can		||
From: alistair@minster.york.ac.uk
Newsgroups: rec.games.trivia
Subject: Peanuts Doctoral Exam
Date: 13 Nov 92 10:26:32 GMT
Organization: Department of Computer Science, University of York, England

I think I must have missed the answers to the above (our link 
with the outside world was a bit ill for a while). Could 
somebody mail me a copy please? I don't think I'm anywhere 
near PhD standard, but I'd like to know if we got ANY of the 
answers right.
Newsgroups: rec.games.trivia
From: morgan@engr.uky.edu (Wes Morgan)
Subject: Re: Riddles
Keywords: Help
Organization: University of Kentucky Engineering Computing Center
Date: Fri, 6 Nov 1992 12:47:40 GMT

rackerma@engr.UVic.CA wrote:
>I need some help solving some riddles.  Here they are:
>
>1) On my roll, you move forward;
>   My turn is your turn.
>   What am I?

A tire, perhaps?  <automobile tire, that is>

>2) Ours is an uneasy friendship.
>   Your fathers toiled long to tame me,
>   But even now I will go my own way
>   If you do not tend me well.
>   I am a powerful destroyer,
>   Yet my frailty is great.
>   What am I?

My environmental frame of mind says "a river".

--Wes
-- 
MORGAN@UKCC         |       Wes Morgan       |        ...!ukma!ukecc!morgan 
morgan@ms.uky.edu   | Engineering  Computing |   morgan@wuarchive.wustl.edu
morgan@engr.uky.edu | University of Kentucky | JWMorgan@dockmaster.ncsc.mil
  Mailing list for AT&T StarServer S/E  - starserver-request@engr.uky.edu
Newsgroups: rec.games.trivia
From: ckp2n@faraday.clas.Virginia.EDU (Christina Powell)
Subject: rec.games.trivia question
Organization: University of Virginia
Date: Fri, 13 Nov 1992 14:29:20 GMT

Chris
Xref: sparky rec.games.corewar:1473 news.answers:3949
Date: Mon,  2 Nov 92 14:51:09 MST
Newsgroups: rec.games.corewar
From: $dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS)
Subject: RED Code wanted
Keywords: red code core war wars corewars
Organization: Brigham Young University

Hello there!

I've recently begun writing my own little warriors for corewars, but I 
think I'm using a non-standard system.  I am very interested in getting in 
on this King of the Hill war, so I need to find a list of commands and 
syntaxes for KotH.

I've looked at soda.berkley, but it looks like what I need is made for UNIX (
the .Z compression).  I'm using a PC--so, is there a list of official 
corewar instructions in a simple text file anywhere?!?

Please let me know!!

THANKS!
Newsgroups: rec.games.corewar
Subject: test
From: cdmcke@musctn.monsanto.com
Date: 10 Nov 92 07:36:52 GMT
Nntp-Posting-User: drboll

test
From: sah@castle.ed.ac.uk (Juggler)
Newsgroups: rec.games.corewar
Subject: Re: Corewars on a PC
Date: 12 Nov 92 16:49:01 GMT
Organization: Black Star

vwulpen@cs.kuleuven.ac.be (Henk Van Wulpen) writes:

>The only problem with it is that it is incredibly slow, especially when
>lots of processes are SPLit off. I believe it is because it was written
>in Prolog, and therefore handles linked lists (the process-queues) in a
>very inefficient way. Actually, I already got an error message (from the
>program) saying that a system error occured. I think it is because the
>program ran out of memory trying to create a new item in the queue.
>Possibly the program doesn't deallocate the space of killed processes.
>The same problem occurs with KotH for PC. As long as the number of rounds
>played is reasonably low and there aren't many SPLs, the program runs ok.
>But with too many rounds or process-creation, the program halts saying that
>it ran out of memory creating a new thread. Since increasing the number of
>rounds should have no effect on the use of memory, I guess that also here the
>problem is that memory isn't freed upon removal of items in the queue.
>Just my opinions though. Any comments of the authors ???

I'll second that. I suffer from the choice of painstakingly loading my
programs into Corewars pro, and having to wait for 20 - 30 minutes for a
result - and that's on a 486 - or setting the koth process limit to 600,
which makes some of the spl 0 killing routines I'm attempting to design
inaccurate. What's more, the debugging facilities of Corewars pro are
completely brill, so having to wait for 5 minutes in order to use them
to fine-tune code (or to find that *invisible* bug thats mysteriously 
fouling up your groundbreaking new 200%xC scanner+replicator+bomber+imp)
is nail-shreddingly frustrating (well, actually, that's exaggerating a
bit. I usually just nip off for a cup of tea). Are there any *fast* PC
redcode processors with debugging facilities? 

	Talking of frustration, whenever I try to perfect my 200%xC
scanner+etc (see above), it moves through various incarnations until
it's perfect, at which stage I usually realise that it's actually just
Emerald (or Nomuckingabout or Imprimis or whatever) with a couple of
numbers changed. All my wholly original codes get completly gubbed by
the "state of the net" ones (why didn't *I* think of impire :-(). In the
true style of most research, I'm therefore limiting my search for
novelty to one (1) original line in any new redcode. With this
groundbreaking new design methodology, I've just sent my latest and
greatest offering to koth (it's called SlowWorm, 'cause it's slow, and
it keeps getting trodden on), with the objective of breaching that
psychological 80 points barrier, which should put it on the hill in
around 35th position...
	Watch me scale those (largely) unconquered heights!

	Si.
	xxx
-- 
S.A.Hovell,Dept. Electrical Engineering,University of Edinburgh,U.K.
(+31) 650-5655	 			          (Juggler@ed.ac.uk) 
-----					         	       -----
Lines: 26
Date: Mon,  9 Nov 92 14:49:11 MST
Newsgroups: rec.games.corewar
From: $dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS)
Subject: Re: Corewars on a PC
Organization: Brigham Young University

>$dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS) writes:
>
>> 
>> I got a cool graphical one from a university in Indiana.  It is NOT ICWS 
>> compliant though (for one thing, it has a random instruction).  Still, it's 
>> fun to watch what is going on.  If you're interested, let me know and I'll 
>> find the ftp address.
>> 
>
>Sounds interesting.  Let me know where I can pick it up...
>
>thanks
>
The graphical version was from (I believe) ftp.cica.indiana.edu , and 
CorewarPro (or something like that) is available as corwpXX.lzh from soda.
berkley.edu.  CorewarPro isn't as good graphically as the program from 
indiana, but it can be ICWS 86, 88 or even X-Hill compatible.  It has a 
built in editor, core inspector, etc.  CorewarPro is the best all around 
system for the PC that I've come across yet (but the graphics aren't that 
great).

Good Luck

____

Douglas R. Nebeker                  Internet: $dougn@sasb.byu.edu
Newsgroups: rec.games.corewar
Subject: Re: Max DAT Value
From: KENT@dirac.physics.jmu.edu (Kent Peterson)
Date: 6 Nov 92 18:31:05 -0500
Distribution: world
Organization: JMU Physics Dept.
X-News-Reader: VMS NEWS 1.24

In <+|#@byu.edu> $dougn@sasb.byu.edu writes:

> Hi there, fellow warriors!

Hi.

> What is the maximum value a DAT can hold?

The size of the core minus one.  Therefore, this will vary depending on
what coresize you're playing with - for example in a coresize of 8192,
the maximum value would be 8191, and in a coresize of 8000, the maximum
value would be 7999.  These would both be treated as -1 for all practical
purposes.  However, this does not mean that you cannot add a number to
this value; the result will be the remainder gotten after division by the
coresize.  For instance, adding 456 to 7999 in a coresize of 8000 would
give you 8455, which gets turned into 455.

> Also, what 
> does DAT #0, #0 do?  (How can a DAT hold two values?)

It doesn't do anything, except kill any process that tries to execute it.
DATs have A-  and B-fields just like all other Redcode instructions,
however "ADD #x, y", "SUB #x, y", and pre-decrement only change the B-field.
To change the A-field, you need to add or subtract an entire instruction to
the DAT, like "ADD x, y" or "SUB x, y".  Also, indirect addressing uses only
the B-field.  For these reasons, when DATs are used as pointers, it is often
easier to use only the B-field and ignore the A-field.

Kent Peterson
From: vwulpen@cs.kuleuven.ac.be (Henk Van Wulpen)
Newsgroups: rec.games.corewar
Subject: SLT
Date: 8 Nov 92 19:51:47 GMT
Organization: Dept. Computerwetenschappen

Hello,

  after having read a lot of stuff about Core War (all doc from soda, and
I've started reading all digests !!!), I have the following question. How
does SLT exactly work ???? I mean, how can one number be less than an other
one !!??? Since Core is circular, all addresses are to be interpreted as
modulo CORESIZE. But as far as I know comparison isn't defined in modulo-
calculus. Is it just that all addresses should be converted to the range
of 0..CORESIZE-1, and then compare these representations ?

   Another question concerns the tournaments. Can a program be entered in
both KotH and the EBS preliminaries ???

Thanks.


Henk.

-----------------------------------------------------------------------------
Henk Van Wulpen                  | Words and eggs must be handled with care.
Engineering and Computer Science | Once broken they are impossible
 senior at the K.U.Leuven        | things to repair.
vwulpen@cs.kuleuven.ac.be        | (Anne Sexton, The Awful Rowing Toward God)
-----------------------------------------------------------------------------
Newsgroups: rec.games.corewar
From: sfdijk@cs.ruu.nl (Steven van Dijk)
Subject: FAQlist request
Date: Tue, 10 Nov 1992 08:32:33 GMT
Organization: Utrecht University, Dept. of Computer Science

Hi everybody,

can someone send me a FAQ-list concerning corewar? It might prevent some 
'stupid' questions (like: 'what IS corewars?' ;-)).

	
-- 

							CU ZVD

------------------------------------------------------------------------------
From: vwulpen@cs.kuleuven.ac.be (Henk Van Wulpen)
Newsgroups: rec.games.corewar
Subject: Re: Corewars on a PC
Date: 9 Nov 92 22:39:28 GMT
Organization: Dept. Computerwetenschappen

In article <&}#@byu.edu>, $dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS) writes:
|> >$dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS) writes:
|> >
|> >> 
|> >> I got a cool graphical one from a university in Indiana.  It is NOT ICWS 
|> >> compliant though (for one thing, it has a random instruction).  Still, it's 
|> >> fun to watch what is going on.  If you're interested, let me know and I'll 
|> >> find the ftp address.
|> >> 
|> >
|> >Sounds interesting.  Let me know where I can pick it up...
|> >
|> >thanks
|> >
|> The graphical version was from (I believe) ftp.cica.indiana.edu , and 
|> CorewarPro (or something like that) is available as corwpXX.lzh from soda.
|> berkley.edu.  CorewarPro isn't as good graphically as the program from 
|> indiana, but it can be ICWS 86, 88 or even X-Hill compatible.  It has a 
|> built in editor, core inspector, etc.  CorewarPro is the best all around 
|> system for the PC that I've come across yet (but the graphics aren't that 
|> great).
|> 
|> Good Luck
|> 
|> ____
|> 
|> Douglas R. Nebeker                  Internet: $dougn@sasb.byu.edu



The only problem with it is that it is incredibly slow, especially when
lots of processes are SPLit off. I believe it is because it was written
in Prolog, and therefore handles linked lists (the process-queues) in a
very inefficient way. Actually, I already got an error message (from the
program) saying that a system error occured. I think it is because the
program ran out of memory trying to create a new item in the queue.
Possibly the program doesn't deallocate the space of killed processes.
The same problem occurs with KotH for PC. As long as the number of rounds
played is reasonably low and there aren't many SPLs, the program runs ok.
But with too many rounds or process-creation, the program halts saying that
it ran out of memory creating a new thread. Since increasing the number of
rounds should have no effect on the use of memory, I guess that also here the
problem is that memory isn't freed upon removal of items in the queue.
Just my opinions though. Any comments of the authors ???

Henk.

-----------------------------------------------------------------------------
Henk Van Wulpen                  | Words and eggs must be handled with care.
Engineering and Computer Science | Once broken they are impossible
 senior at the K.U.Leuven        | things to repair.
vwulpen@cs.kuleuven.ac.be        | (Anne Sexton, The Awful Rowing Toward God)
-----------------------------------------------------------------------------
Lines: 17
Date: Thu,  5 Nov 92 15:46:50 MST
Newsgroups: rec.games.corewar
From: $dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS)
Subject: Re: Corewars on a PC
Organization: Brigham Young University

In article <wTNRTB3w165w@cerianthus.pinetree.org> cowan@cerianthus.pinetree.org (Darin Cowan - root) writes:
>Subject: Corewars on a PC
>From: cowan@cerianthus.pinetree.org (Darin Cowan - root)
>Date: Thu, 05 Nov 92 12:42:43 GMT
>Is a DOS version of corewars still available?  I used to have it but can't
>find it any more...
>

I got a cool graphical one from a university in Indiana.  It is NOT ICWS 
compliant though (for one thing, it has a random instruction).  Still, it's 
fun to watch what is going on.  If you're interested, let me know and I'll 
find the ftp address.

____

Douglas R. Nebeker           Internet: $dougn@sasb.byu.edu
From: cowan@cerianthus.pinetree.org (Darin Cowan - root)
Newsgroups: rec.games.corewar
Subject: Re: Corewars on a PC
Date: Fri, 06 Nov 92 21:04:45 GMT
Organization: The Aquarium, Ottawa, Ontario

$dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS) writes:

> 
> I got a cool graphical one from a university in Indiana.  It is NOT ICWS 
> compliant though (for one thing, it has a random instruction).  Still, it's 
> fun to watch what is going on.  If you're interested, let me know and I'll 
> find the ftp address.
> 

Sounds interesting.  Let me know where I can pick it up...

thanks
From: cowan@cerianthus.pinetree.org (Darin Cowan - root)
Newsgroups: rec.games.corewar
Subject: Corewars on a PC
Date: Thu, 05 Nov 92 12:42:43 GMT
Followup-To: cowan@cerianthus.pinetree.org
Organization: The Aquarium, Ottawa, Ontario

Is a DOS version of corewars still available?  I used to have it but can't
find it any more...

Newsgroups: rec.games.corewar
From: stst@vuse.vanderbilt.edu (Stefan Strack)
Subject: Re: Corewars on a PC
Organization: Vanderbilt University School of Engineering, Nashville, TN, USA
Date: Thu, 12 Nov 1992 20:45:09 GMT

In article <1992Nov9.223928.24097@cs.kuleuven.ac.be> vwulpen@cs.kuleuven.ac.be (Henk Van Wulpen) writes:
>[Speaking about CoreWar Pro]
>The only problem with it is that it is incredibly slow, especially when
>lots of processes are SPLit off. I believe it is because it was written
>in Prolog, and therefore handles linked lists (the process-queues) in a
>very inefficient way. Actually, I already got an error message (from the
>program) saying that a system error occured. I think it is because the
>program ran out of memory trying to create a new item in the queue.
>Possibly the program doesn't deallocate the space of killed processes.
>The same problem occurs with KotH for PC. As long as the number of rounds
>played is reasonably low and there aren't many SPLs, the program runs ok.
>But with too many rounds or process-creation, the program halts saying that
>it ran out of memory creating a new thread. Since increasing the number of
>rounds should have no effect on the use of memory, I guess that also here the
>problem is that memory isn't freed upon removal of items in the queue.
>Just my opinions though. Any comments of the authors ???
>
>Henk.

As the author of CoreWar Pro and the "porter" of KotHPC I oughta reply to this.
And yes, my name and email address is listed prominently in the doc's to both
packages.

Anyway, Henk is right, CoreWar Pro is slow because it is written in Prolog
(PDC Prolog, former Turbo Prolog to be exact). No remedy for that unless
I get the funds for the lastest version of the compiler (3.3) which has
an array datatype (makes for a much more efficient implemetation of the 
process queue).

As for KotHPC, the reason that the programs bombs earlier when "rounds" is
high is that the free() in Turbo C 1.5/2.0 is not 100% efficient.

Hope this helps, Stefan (stst@vuse.vanderbilt.edu)

P.S.: Those in need of a speedy, good-looking PC version of corewar that
has reasonable debugging features should check out Nandor Sieben's MARS.
I had the pleasure to try out an alpha-version of V2.0 and it looks good.
I don't know if Nandor uploaded the latest version to soda yet. Nandor?
Newsgroups: rec.games.corewar
Subject: Re: SLT
From: Jeff Raven <JAR129@psuvm.psu.edu>
Date: Thu, 12 Nov 1992 18:31:33 EST
Organization: Penn State University

>Well that isn't exactly what my problem is... Take the following code for
>instance :
>        JMP     lbl,    #-1
>        DAT     #0,     #0
>        SLT     -1,     -2
>Now, the SLT compares  #0  to  #-1, but is #0 less than or greater than #-1
>???
>Is #-1 converted to CORESIZE-1 ??? Or does the comparison evaluate as true
>(i.e. #-1 is less than #0) ?

In corewars, there is no such thing as a negative value - all arithmetic
is done modulo CORESIZE. When the above commands are assembled, the lines
will become (assuming CORESIZE = 8000) :
     JMP   lbl,   #7999
     DAT   #0,    #0
     SLT   7999,  7998
Therefore, the comparison will be between 0 and 7999. Then the SLT
will evaluate as true since 0 < 7999. The modulo arithmetic applies
to every command - so
one  DAT #2
two  DAT #1
     SUB one, two

will change things to

one  DAT #2
two  DAT #7999
     SUB one, two

Answer your question?

Jeff Raven
jar129@psuvm.psu.edu
Lines: 13
Date: Thu,  5 Nov 92 16:58:33 MST
Newsgroups: rec.games.corewar
From: $dougn@sasb.byu.edu (Douglas R. Nebeker - MIS_SAS)
Subject: Max DAT Value
Organization: Brigham Young University



Hi there, fellow warriors!

What is the maximum value a DAT can hold?  I've read the FAQ, the tutor and 
the ICWS 86 and 88 standards, but haven't run across this yet.  Also, what 
does DAT #0, #0 do?  (How can a DAT hold two values?)

THANKS

____

Douglas R. Nebeker              Internet: $dougn@sasb.byu.edu
Newsgroups: rec.games.corewar
From: pk6811s@acad.drake.edu
Subject: Re: Original and Copycatting
Organization: Drake University, Des Moines, Iowa, USA
Date: Thu, 12 Nov 1992 19:38:36 GMT

In article <28067@castle.ed.ac.uk>, sah@castle.ed.ac.uk (Juggler) writes:
> 
> 	Talking of frustration, whenever I try to perfect my 200%xC
> scanner+etc (see above), it moves through various incarnations until
> it's perfect, at which stage I usually realise that it's actually just
> Emerald (or Nomuckingabout or Imprimis or whatever) with a couple of
> numbers changed. All my wholly original codes get completly gubbed by
> the "state of the net" ones (why didn't *I* think of impire :-(). In the
> true style of most research, I'm therefore limiting my search for
> novelty to one (1) original line in any new redcode. With this
> groundbreaking new design methodology, I've just sent my latest and
> greatest offering to koth . . .

One of the risks of publishing a good program is that others will make
a minor change to it and send it up.  Almost immediately after publishing
Imprimis a couple of *presumably-similar* programs appeared (Plasma Sheep
and - oh what's the name of that other one - +1 Tearjerker or something).
But in the long run, that's not really a problem.  The more versions of
similar programs that get put up, the more likely someone will write
a program that attacks just those programs successfully and move them
down the ladder.  Then someone will work out an improvement on the
base design that differentiates their version, and that gets everyone
going again.

For example, Flash Paper was very successful over the summer, until
some act-alikes made their way onto the hill.  It couldn't beat them
so its' own score began to slide.  Eventually, even Matt took another
look at the program and worked out an improvement.  First introductions
of new concepts are usually open for major improvements - witness Impire.

Of course no one wants 20 versions of Imprimis or Emerald or ScamScan
or whatever, so everybody continues to work on improving the designs
of all (now) four types of fighters - bombers, scanners, replicators,
and imps.  Each has a natural advantage over at least one of the
others and can be improved to do better against the rest.

For the continuing good of the game, we need to see more good code 
published.  Maybe next week, after the EBS tourney, folks will open
up a bit?  Please?

Paul Kline
pk6811s@acad.drake.edu
Newsgroups: rec.games.corewar