HDTenEightyP/NetNews huggingface dataset:
From: carl@SOL1.GPS.CALTECH.EDU (Carl J Lydick)
Newsgroups: vmsnet.tpu
Subject: Re: Has anything like this ever been done before?
Date: 23 Jan 1993 23:00:39 GMT
Organization: HST Wide Field/Planetary Camera
Distribution: world
Reply-To: carl@SOL1.GPS.CALTECH.EDU
NNTP-Posting-Host: sol1.gps.caltech.edu

In article <930123141203.25003b75@HANNA2.NLU.EDU>, <92adams@hanna2.nlu.edu> writes:
>  1)  Run a DCL command file, and capture the output into another buffer.
>
>	Yes, I know that can be done with DCL etc.., but I wanted a more
>'elegant' solution to it.  I'd like it all automatic.  Minimal user effort
>required.

This is rather vague.  The TPU primitives for such an operation are
create_process(), send(), and send_eof().  If you'd been more specific about
what you wanted, I might've been able to post an example for you.

>  2)  Have it look for the 'From:' line in a message, extract the persons
>name/address and put it into a format like '*Name/Addr just extracted* wrote:'

PROCEDURE WHOFROM
	LOCAL R, M;
	ON_ERROR
		POSITION(M);
	ENDON_ERROR;

	M:=MARK(NONE);
	POSITION(BUFFER_BEGIN);
	R:=SEARCH(LINE_BEGIN & 'From:' & SPAN(' 	'), FORWARD);
	POSITION(END_OF(R));
	MOVE_HORIZONTAL(1);
	R:=SEARCH(REMAIN,FORWARD);
	R:=SUBSTR(R, 1, LENGTH(R));
	POSITION(BUFFER_BEGIN);
	COPY_TEXT(R + " wrote:");
	SPLIT_LINE;
	POSITION(M);
ENDPROCEDURE;

>  	That's all the 'wants' that I have at the moment.  ;-)  If no such
>animals exist now, can someone tell me where I'd need to start at?  (Yes, I am
>a TPU newbie :)

You can start by reading the TPU manual, or by issuing the command:
	<DO>HELP TPU<RET>
from within EVE.
--------------------------------------------------------------------------------
Carl J Lydick | INTERnet: CARL@SOL1.GPS.CALTECH.EDU | NSI/HEPnet: SOL1::CARL

Disclaimer:  Hey, I understand VAXen and VMS.  That's what I get paid for.  My
understanding of astronomy is purely at the amateur level (or below).  So
unless what I'm saying is directly related to VAX/VMS, don't hold me or my
organization responsible for it.  If it IS related to VAX/VMS, you can try to
hold me responsible for it, but my organization had nothing to do with it.
Newsgroups: gnu.chess
From: sprute@math10.mathematik.uni-bielefeld.de (Udo Sprute)
Subject: Where to find chess software
Date: Tue, 26 Jan 1993 02:53:52 GMT
Organization: Math MadHouse Bielefeld, Germany

In article <1993Jan25.144506.2@skaro.demon.co.uk> richard@skaro.demon.co.uk (Richard Develyn) writes:

>Where might I find the latest version of this for a PC ?

Everything concerning chess that can be found in the Internet
should be on valkyries.andrew.cmu.edu's anonymous FTP account
with its newest version.

If you find anything that is not there,
give me a mail and I'll put it there.

Udo Sprute  (sprute@unibi.HRZ.Uni-Bielefeld.DE)
From: jcharpak@acs.bu.edu (Joseph Charpak)
Newsgroups: gnu.chess
Subject: Re: ICS -- like to set up a local node...
Keywords: archie -c
Date: 27 Jan 93 19:10:16 GMT
Organization: Boston University, Boston, MA, USA

In article <sherman.728087266@foster> sherman@unx.sas.com (Chris Sherman) writes:

>(The letters ICS also appear in 'graphics', so I'm not even going to try
>archie...  :)
>
>Thanx!
>-- 
you might try giving it a case sensitive substring search (i.e. ICS) by
passing it -c (for case sensitive) sorry I can't help much on you real
problem.





-- 
----------------------------------------------------------------
no sig so shoot me (Shields up...Red Alert)|                    |
Darnit Jim, I'm a doctor, not a clown...   | jcharpak@acs.bu.edu|
What? Oh...I'm that too.                   | Joseph Charpak     |
From: mitch@momo.lakes.trenton.sc.us (Mitch Quinn (SYSOP))
Newsgroups: gnu.chess
Subject: where can I find the latest version?
Date: Wed, 20 Jan 93 22:00:09 EST
Organization: MOMO: Aiken, SC, 29803

Where can I find the latest version of gnuchess?
                mitch
                mitch@momo.lakes.trenton.sc.us
Newsgroups: gnu.chess
From: jon@cas.org (Jon Vander Hill)
Subject: Re: Iterative Deepening
Organization: Chemical Abstracts Service, Columbus, Ohio
Distribution: gnu
Date: Mon, 25 Jan 1993 16:03:40 GMT

>>>>> On 22 Jan 93 07:34:07 GMT, lim@toadflax.cs.ucdavis.edu (Lloyd Lim) said:

> In article <C15r40.D1r@sju.edu> tmoody@sju.edu (T. Moody) writes:
>>
>>My real problem is with (b).  Levy and Newborn say
>>something about searching at a given level and storing lots of positions
>>in a hash table before moving to the next level.  Is this the only way
>>to do it?  I don't know a thing about hash tables and, from what I have
>>read it looks like it's over my head.
>>
>>So my question is, can iterative deepening be usefully (if not
>>optimally) accomplished without using hash tables?

> Iterative deepening is commonly used with transposition (hash) tables,
> but it doesn't require them.  Iterative deepening just means increasing
> the search depth by one each time (i.e. - searching to a depth of 1,
> then 2, then 3, ...).  You don't need to use transposition tables.
> They are just used to speed things up, because many of the same nodes
> are encountered again when you search to depth n+1.

One the the more expensive routines in a chess programs is the
move generation function.  The transposition table limits the
number of times that move generation is called to once per position.
I agree that a transpositon table is not necessary to do iterative
deepening, but even shallow chess trees can involve thousands
of positions.

The transposition table is can also speed up the search by giving
a score for a position that my have been generated in a parallel
branch of the tree.

Jon Vander Hill
jon@cas.org

Newsgroups: gnu.chess
From: sherman@unx.sas.com (Chris Sherman)
Subject: ICS -- like to set up a local node...
Date: Tue, 26 Jan 1993 22:27:46 GMT
Organization: SAS Institute Inc.

In the docs for xboard, it mentions that it can connected to an ICS node
somewhere on the internet.  I would like to setup a local ICS node so that
people on our own private network can play against each other.  

Can anyone give me more information on where to find this software?

(The letters ICS also appear in 'graphics', so I'm not even going to try
archie...  :)

Thanx!
-- 
     ____/     /     /     __  /    _  _/    ____/
    /         /     /     /   /      /     /          Chris Sherman
   /         ___   /        _/      /          /
 _____/   __/   __/   __/ _\    _____/   _____/           sherman@unx.sas.com
From: johnson@physics.berkeley.edu (Steve Johnson)
Newsgroups: gnu.chess
Subject: Gnu on DOS?
Date: 24 Jan 93 15:22:14
Organization: Lawrence Berkeley Laboratory (Theoretical Physics Group)
Reply-To: johnson@physics.berkeley.edu
NNTP-Posting-Host: physics.berkeley.edu

Sorry if this is a faq, but has gnu chess been compiled to run on DOS?
I have done some poking around but have been unable to figure this
out.  If so, where can i find it?

Thanks,

--Steve
From: lim@toadflax.cs.ucdavis.edu (Lloyd Lim)
Newsgroups: gnu.chess
Subject: Re: Iterative Deepening
Date: 22 Jan 93 07:34:07 GMT
Distribution: gnu
Organization: Department of Computer Science, University of California, Davis

In article <C15r40.D1r@sju.edu> tmoody@sju.edu (T. Moody) writes:
>
>My real problem is with (b).  Levy and Newborn say
>something about searching at a given level and storing lots of positions
>in a hash table before moving to the next level.  Is this the only way
>to do it?  I don't know a thing about hash tables and, from what I have
>read it looks like it's over my head.
>
>So my question is, can iterative deepening be usefully (if not
>optimally) accomplished without using hash tables?

Iterative deepening is commonly used with transposition (hash) tables,
but it doesn't require them.  Iterative deepening just means increasing
the search depth by one each time (i.e. - searching to a depth of 1,
then 2, then 3, ...).  You don't need to use transposition tables.
They are just used to speed things up, because many of the same nodes
are encountered again when you search to depth n+1.

+++
Lloyd Lim                    Internet: lim@cs.ucdavis.edu
Lim Unlimited                America Online: LimUnltd
330 W. Iris Ave.             AppleLink: LimUnltd
Stockton, CA  95210-3738     CompuServe: 72647,660
From: richard@skaro.demon.co.uk (Richard Develyn)
Newsgroups: gnu.chess
Subject: Latest version for PC
Date: 25 Jan 1993 09:12:28 -0600
Organization: skaro
NNTP-Posting-Host: cs.utexas.edu

Where might I find the latest version of this for a PC ?
Richard
From: muswick@vs2.uh.cwru.edu (Gary James Muswick)
Newsgroups: gnu.chess
Subject: GNU Chess 4.0 for VMS??
Date: 22 Jan 1993 02:43:49 GMT
Organization: Image Analysis Center, Univ. Hospitals of Cleveland
Distribution: world
Reply-To: muswick@vs2.uh.cwru.edu
NNTP-Posting-Host: max.uh.cwru.edu
Keywords: gnuchess,vax,vms


I just got the latest copy of gnuchess from prep.  In looking over the
makefile and sources, it does not appear that it has been ported to VMS, even
though, history records shows it to run on VAX systems.  

My question is: Has anyone ever ported gnuchess to run/build under VMS.

I would perfer not to reinvent the wheel if someone has accomplished this
already.  If I do not get any replies, I will probaly start porting it.  If
others have interest in the port, please e-mail me.  

Thanks

Gary Muswick
Image Processing Engineer
Newsgroups: gnu.chess
From: dspencer@spock.retix.com (David Spencer)
Subject: Re: Iterative Deepening
Organization: Retix, Santa Monica, CA USA
Distribution: gnu
Date: Mon, 25 Jan 1993 21:49:18 GMT

In article <JON.93Jan25110340@cas.org> jon@cas.org (Jon Vander Hill) writes:
>>>>>> On 22 Jan 93 07:34:07 GMT, lim@toadflax.cs.ucdavis.edu (Lloyd Lim) said:
>
>> In article <C15r40.D1r@sju.edu> tmoody@sju.edu (T. Moody) writes:
>>>
>>>My real problem is with (b).  Levy and Newborn say
>>>something about searching at a given level and storing lots of positions
>>>in a hash table before moving to the next level.  Is this the only way
>>>to do it?  I don't know a thing about hash tables and, from what I have
>>>read it looks like it's over my head.
>>>
>>>So my question is, can iterative deepening be usefully (if not
>>>optimally) accomplished without using hash tables?
>
>> Iterative deepening is commonly used with transposition (hash) tables,
>> but it doesn't require them.  Iterative deepening just means increasing
>> the search depth by one each time (i.e. - searching to a depth of 1,
>> then 2, then 3, ...).  You don't need to use transposition tables.
>> They are just used to speed things up, because many of the same nodes
>> are encountered again when you search to depth n+1.
>
>One the the more expensive routines in a chess programs is the
>move generation function.  The transposition table limits the
>number of times that move generation is called to once per position.
				                   ^^^^^
Um, I don't think that this is so.  From the aritcles I've read and
the source code I've seen, the "typical" transposition table entry
has the best move for a position, but *not* all the pseudo-legal
moves for that position. So it's possible that the stored bounds
and stored move doesn't cause a cutoff, thus the legal moves for
the current position may have to be generated *again*.

I guess that in general the move generation function may not be called
more that once per pos, but it certainly doesn't limit the calls to
once per position.

Newsgroups: gnu.chess
From: roland@sics.se (Roland Karlsson)
Subject: Re: Iterative Deepening (The true story)
Organization: Swedish Institute of Computer Science, Kista
Distribution: gnu
Date: Mon, 25 Jan 1993 20:48:58 GMT


The original reason for iterative deepening was to speed up alpha-beta
pruning.  The pruning is most efficient when the moves to try is
sorted best first.  One way of approximize this is to first search a
few plies, sort the result best move first, and then search deeper.

Iterative deepening also makes it easier to play according to a chess
clock.  Stopping a deep search, without having the result from a more
shallow one is a catastrophe.

Transposition tables and iterative deepening is two different methods
to improve chess playing.  But both can be used without the other.


--
Roland Karlsson             SICS, PO Box 1263, S-164 28 KISTA, SWEDEN
Internet: roland@sics.se    Tel: +46 8 752 15 40          Fax: +46 8 751 72 30
Telex: 812 6154 7011 SICS   Ttx: 2401-812 6154 7011=SICS
Newsgroups: gnu.chess
From: lano@dcs.warwick.ac.uk (Lee Nowell)
Subject: Computer Chess help required
Organization: Department of Computer Science, Warwick University, England
Distribution: uk
Date: Sun, 24 Jan 1993 13:42:26 GMT


I am looking for a chess program for the sinclair QL. I had an original copy of
psion chess but even though it was backed up you still have to use the original
for the final loading stage. Due to this, the micro drive cartridge has worn
out and hence does not work any more.

Does anyone have or know where I can get a copy of chess for the QL (preferable
psion but not essential). I am willing to negotiate a good price for it.


Cheers


Lee.
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: None
Date: 27 Jan 93 16:34:02 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab

This is boring test message #2.




Newsgroups: gnu.gnusenet.test
From: beast@MathWorks.COM (Dave Henry)
Subject: last test
Organization: The Mathworks, Inc.
Distribution: ne
Date: Tue, 26 Jan 1993 13:39:28 GMT

My last test (I hope)

-- 
Dave Henry				# EMAIL: beast@MathWorks.COM
Postmaster, News Admin, Network Manager	# VOICE: +1 508 653 2452, x322
The MathWorks, Inc.	# "They stab it with their steely knives,
Natick, MA, USA		# "but they just can't kill the Beast..." -- Eagles
From: beast@MathWorks.COM (Dave Henry)
Newsgroups: gnu.gnusenet.test
Subject: Test Again
Date: 23 Jan 93 23:22:23 GMT
Distribution: gnu
Organization: The MathWorks, Inc., Natick, MA


Another test of news.
Please ignore.
No reply necessary as I'm monitoring it on this end.

-- 
Dave Henry				# EMAIL: beast@MathWorks.COM
Postmaster, News Admin, Network Manager	# VOICE: +1 508 653 2452, x322
The MathWorks, Inc.	# "They stab it with their steely knives,
Natick, MA, USA		# "but they just can't kill the Beast..." -- Eagles
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Re: Test
Date: 27 Jan 93 22:27:05 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab

Posting a message at 2:21 p.m. after the "Keywords:"
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: posting from aisserver1 at 2:45 p.m. on 1/27/93
Date: 27 Jan 93 22:46:27 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: posting of text
Date: 27 Jan 93 23:20:09 GMT
Reply-To: 68a869@llnl.gov
Organization: Lawrence Livermore National Lab

Is this text posting?
From: moler@MathWorks.COM (Cleve Moler)
Newsgroups: gnu.gnusenet.test
Subject: Test
Date: 23 Jan 93 23:39:39 GMT
Distribution: gnu
Organization: The MathWorks, Inc., Natick, MA

Test from CBM.
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Re: Test
Date: 27 Jan 93 22:23:25 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab



Newsgroups: gnu.gnusenet.test
From: beast@MathWorks.COM (Dave Henry)
Subject: Test from MathWorks
Organization: The MathWorks, Inc., Natick, MA
Distribution: gnu
Date: Fri, 22 Jan 1993 20:13:20 GMT


Testing our ability to post news....

		-Dave

-- 
Dave Henry				# EMAIL: beast@MathWorks.COM
Postmaster, News Admin, Network Manager	# VOICE: +1 508 653 2452, x322
The MathWorks, Inc.	# "They stab it with their steely knives,
Natick, MA, USA		# "but they just can't kill the Beast..." -- Eagles
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Boring test
Keywords: This is a boring test message.
Date: 27 Jan 93 16:26:49 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab



Newsgroups: gnu.gnusenet.test
From: rick@dirac.i-kinetics.com (Rick Rousseau)
Subject: test from i-kinetics
Organization: I-Kinetics, Inc., Cambridge, MA USA
Distribution: gnu
Date: Fri, 22 Jan 1993 02:25:57 GMT

this is a test, this is only a test;
if this had been an actual message,
you would have been informed as to
	some real information :)
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Test
Date: 27 Jan 93 22:18:35 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Posting of text from aisws10
Date: 27 Jan 93 23:13:47 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Re: None - testing reply
Date: 27 Jan 93 16:58:35 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab

Replying to message 526 from aisws10
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: None
Keywords: This is a posting from aisserver1 at 2:37 p.m.
Date: 27 Jan 93 22:38:15 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Signature test
Date: 26 Jan 93 16:52:46 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab

The Art of the Internet says a .signature file is appended to each message.  Let's see if it works.
From: mounil@mathworks.com (Mounil Patel)
Newsgroups: gnu.gnusenet.test
Subject: Test
Date: 26 Jan 93 18:53:26 GMT
Distribution: ne
Organization: The MathWorks, Inc.
X-Useragent: Nuntius v1.1


Testing news from our Macintosh news reader.
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: posting of text from aisserver1
Date: 27 Jan 93 23:11:18 GMT
Reply-To: 68a869@llnl.gov
Distribution: llnl
Organization: Lawrence Livermore National Lab




Newsgroups: gnu.gnusenet.test
From: beast@MathWorks.COM (Dave Henry)
Subject: Testing again...
Organization: The Mathworks, Inc.
Distribution: ne
Date: Tue, 26 Jan 1993 13:03:29 GMT


Testing new news config...

-- 
Dave Henry				# EMAIL: beast@MathWorks.COM
Postmaster, News Admin, Network Manager	# VOICE: +1 508 653 2452, x322
The MathWorks, Inc.	# "They stab it with their steely knives,
Natick, MA, USA		# "but they just can't kill the Beast..." -- Eagles
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Re: test
Date: 25 Jan 93 22:46:10 GMT
Reply-To: 68a869@llnl.gov
Organization: Lawrence Livermore National Lab

Aha! My first missage!
From: 68a869@llnl.gov (Jeff Busch)
Newsgroups: gnu.gnusenet.test
Subject: Test posting
Date: 28 Jan 93 21:41:27 GMT
Reply-To: 68a869@llnl.gov
Organization: Lawrence Livermore National Lab

This is my article.

---
This is my signature


Newsgroups: gnu.gnusenet.test
From: Dave Henry <beast@MathWorks.COM>
Subject: Test from Mac
Organization: The MathWorks, Inc., Natick, MA
X-Useragent: Nuntius v1.1
Distribution: ne
Date: Tue, 26 Jan 1993 13:13:57 GMT


Test of posting from our Macintosh news reader...
Xref: sparky gnu.gnusenet.config:27 news.admin.misc:1224
From: jgreely@morganucodon.cis.ohio-state.edu (J Greely)
Newsgroups: gnu.gnusenet.config,news.admin.misc
Subject: Re: Should 'gnu' be a valid distribution?
Date: 28 Jan 1993 17:18:23 -0500
Organization: Ohio State University Computer and Information Science
	<C1Kq41.3LM.2@cs.cmu.edu> <1993Jan28.214241.1296@darwin.sura.net>
NNTP-Posting-Host: morganucodon.cis.ohio-state.edu
In-reply-to: jmalcolm@sura.net's message of Thu, 28 Jan 1993 21:42:41 GMT

In article <1993Jan28.214241.1296@darwin.sura.net> jmalcolm@sura.net
 (Joseph Malcolm) writes:
>Fairly high attrition rate there, eh?

I think it comes to about 35% per year.  I was hired a little over
three years ago, and I'm second in seniority.  Hell, three (or is it
four) people who were hired *after* I was have left already.  I've
been toying with the idea of having t-shirts printed up: a rat wearing
a sailor hat and running shoes, mascot of the "OSU-CIS Synchronized
Sinking Team".
-- 
J Greely (jgreely@cis.ohio-state.edu; osu-cis!jgreely)
Newsgroups: gnu.gnusenet.config,news.admin.misc
From: jmalcolm@sura.net (Joseph Malcolm)
Subject: Re: Should 'gnu' be a valid distribution?
Organization: SURAnet, College Park, MD, USA, NA, Earth, Milky Way
Date: Thu, 28 Jan 1993 21:42:41 GMT

In article <C1Kq41.3LM.2@cs.cmu.edu> Karl_Kleinpaste@cs.cmu.edu writes:
>jmalcolm@sura.net writes:
>   the person who originally gatewayed the gnu.* groups said that
>   the gnu distribution was indeed deliberate.
>
>That was possibly me, but more likely Bob Sutterfield.

I think it was Bob Sutterfield.

>The reason it's there is that the gateway software in use at the time
>was Erik Fair's newsgate code, which was largely a couple of
>horrendous awk(1) scripts along with some m4(1) incantations to create
>the /usr/lib/aliases and sys file entries.  The specific problem (as I
>recall; memory is fuzzy by now) was that the m4 macros required a
>distribution (for Erik's purposes, this was usually "inet") and we
>couldn't think of anything more appropriate.  I distinctly recall
>trying to use "world," only to find that some piece of the news
>software tossed its cookies as a result.  "gnu" may have just been a
>compromise to make the beastie work at all, and under B News, that was
>OK.

OK. This wasn't what Bob Sutterfield said, as best I recall, the last
time this came up. But this does seem to indicate that there is no
particular reason that there *needs* to be a gnu distribution.

>   We'd actually like to get out of the gatewaying business altogether
>   (we do more than gnu.*); it's one more complexity for our shrinking
>   staff to cope with.
>
>OSU Computer Science system support staff: 6 years and 17 hirings
>later, the software staff still consists of about 3 people...

Fairly high attrition rate there, eh?

-- 
Joseph Malcolm				jmalcolm@sura.net		
SURAnet Operations			+1 301 982 4600
Xref: sparky gnu.gnusenet.config:24 news.admin.misc:1204