HDTenEightyP/NetNews huggingface dataset:
Newsgroups: vmsnet.tpu
Subject: Rectangular Highlighting
From: williams@ab.wvnet.edu
Date: Tue, 22 Dec 1992 08:13:42 -0500 (EST)
Reply-To: williams@ab.wvnet.edu
Organization: The Internet
Return-Path: <TPU-Mgr@SHSU.edu>
Errors-To: TPU-Mgr@SHSU.edu
X-Listname: Text Processing Utility (TPU) Language Discussion List
Return-Path: <!ab.wvnet.edu!williams@mccall.uucp>
Resent-Message-ID: <9212221345.AA05017@depot.cis.ksu.edu>
Resent-Date: Tue, 22 Dec 1992 07:42:37 CST
Resent-From: info-tpu-newsgate@mccall.com
Resent-To: info-tpu@shsu.edu
X-Envelope-To: info-tpu-newsgate@mccall.uucp
X-Vms-To: NET::"info-tpu-newsgate@mccall.uucp"
X-Vms-Cc: ME
Mime-Version: 1.0
Content-Transfer-Encoding: 7BIT

> From: "kacovert@miavx1.acs.muohio.edu" 22-DEC-1992 01:19:04.64
>
> The selection should be in bold rather than inverse video.  The
> selection also looks like it's selecting lines, but trust me, it'll
> work (BTW, why doesn't box selects highlight boxes rather than lines -
> this doesn't make sense to me.)  Then issue the cut command.
>
>                              Kent Covert, Software Coordinator
>                              Miami Computing and Information Services


          EVE's highlighting in character mode rather than block mode
          is probably due to a couple of things:

            1.  The TPU engine underneath EVE does not currently
                support blocks.  The block mode work is  done pretty
                much by EVE, which does not have any display control.

            2.  The difficulty of highlighting a block is pretty
                significant, especially if you do it in EVE.

          Imagine a block selection that's 100 lines high and 10
          characters wide.  Your cursor is in the lower righ-hand
          corner.  Now, move the cursor one character to the right.
          The EVE code would have to update all the ranges in a 100
          range array.   Now, imagine you've decided to hold the
          cursor down for 3 seconds, engaging auto-repeat for 2.5 of
          them....

          There's also the problem of what to do (in the display) if
          some lines are not as wide as the selected range.

                                                Freely hypothesizing,

                                                -Tom Williams
                                                 Computer Center Manager
                                                 Alderson-Broaddus College
                                                 WILLIAMS@AB.WVNET.EDU
Newsgroups: vmsnet.tpu
Subject: Re: Help on "simple" EVE/TPU procedure
From: tas@madre.dasd.honeywell.com (Todd A Sorensen)
Date: 21 Dec 92 10:51:58 MST
Organization: Honeywell Flight Management Systems
Nntp-Posting-User: tas

In article <BzKtA4.D67@news.cso.uiuc.edu>, ritley@uimrl7.mrl.uiuc.edu () writes:
> 
> I am trying to clean up large amounts of Fortran code which
> contains "junk" in each record of each file, beyond the
> 72-nd character position in each record.
> 
> 
-- 

Here is a simple procedure to do that, but I might use a learn sequence if I
knew what the file looked like, since that is usually faster than writing a TPU
procedure and debugging it, and then running it on the file.

For the most part, I use LSE since I do embedded stuff, but I think you can
compile this with "extend this" and save your section file.  The procedure can
be invoked with "tpu d72".  The way I determine end of buffer might be
cumbersome, so I am open to suggestions from the "pros".


-----cut here---------------------------------------------------------------
procedure d72

!  Mark end of buffer

  position(buffer_end);
  eob := mark(none);
  position(buffer_begin);

  loop	      
    position(line_begin);
    eob1 := mark(none);     ! mark current position
    exitif (eob1=eob);      ! exit if end of buffer
    col72 := cursor_horizontal(72);   ! move to col 72
    erase_character(length(current_line) - 72);  ! erase to eol
    move_vertical(1);
  endloop

endprocedure;

-----cut here---------------------------------------------------------------

-------------------------------------------------------------------------------
Todd A Sorensen               Honeywell Defense Avionics Systems Division
(505) 828-5611                internet: tas@dasd.honeywell.com
                              fax: (505) 828-5500
------------------------------------------------------------------------------- 
Why celebrate CHRISTmas if you don't believe in Him?
Newsgroups: vmsnet.tpu
From: fairfield@slacvx.slac.stanford.edu
Subject: LSE: Including eve features?
Followup-To: comp.os.vms,vmsnet.tpu
Reply-To: sean@bartol.bartol.udel.edu
Organization: Stanford Linear Accelerator Center
Date: Tue, 22 Dec 1992 21:42:56 GMT

    The following is cross-posted from comp.os.vms 'cause I thought people
here might have the answers ;-)  

				-Ken
--
In article <BzoI93.LEp@news.udel.edu>, oughton@chopin.udel.edu (Sean Oughton) writes:
> We've just obtained the LSE, so I'm in the process of switching over 
> from using EVE to LSE.  There are some things I haven't found.
> 
> 1. How can I get the eve type learn/remember behaviour in lse?
> 
> 2. Can I set nowrap and right margin = 72 (for example) for all buffers
> (i.e. in the startup command file once ond for all)?
> 
> 3. Can I set the prompt buffer for LSE commnds (i.e., after hitting 
> the DO key or typing ctrl-z) so that it is permamently in insert mode?
> 
> 4. Are there any language interfaces available for 
> latex (or perhaps even IDL)? 
> 
> Thanks,
> 
>         sean@bartol.bartol.udel.edu
-- 
 Dr. Kenneth H. Fairfield    |  Internet: Fairfield@Slac.Stanford.Edu
 SLAC, P.O.Box 4349, MS 98   |  DECnet:   45537::FAIRFIELD (45537=SLACVX)
 Stanford, CA   94309        |  BITNET    Fairfield@Slacvx
 ----------------------------------------------------------------------------
 These opinions are mine, not SLAC's, Stanford's, nor the DOE's...
Newsgroups: vmsnet.tpu
From: carl@SOL1.GPS.CALTECH.EDU (Carl J Lydick)
Newsgroups: vmsnet.tpu
Subject: Re: Pattern
Date: 31 Dec 1992 17:33:20 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 <1hsqeoINNmqe@usenet.INS.CWRU.Edu>, at913@cleveland.Freenet.Edu (Mirko Vukovic) writes:
>predig:=span('0123456789');			<--- for aaaa
>posdig:=anchor&span('0123456789');		<--- for bbbb
>per:='.';					<--- for .
>exp:=anchor&(notany('dD')|line_end);		<--- for X
>
>find :=((predig&per&exp)|(per&posdig&exp)|(predig&per&posdig&exp));
>
>However the above does detect numbers like 123.12D00, ie if I have more than one
>digit after the period followed by D.

It also does not detect numbers like 123.12.  In particular, it  only picks up
the "123.1" part of i.

>Is that because in posdig anchor forces the span to match only one character?

No, it's because the exp picks up only one character.

>Also, how do I put a cursor on the end of a range?

position(end_of(range));
--------------------------------------------------------------------------------
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: vmsnet.tpu
From: fairfield@slacvx.slac.stanford.edu
Subject: Re: Help on "simple" EVE/TPU procedure
Organization: Stanford Linear Accelerator Center
Date: Tue, 22 Dec 1992 19:02:34 GMT

In article <1992Dec22.155456.6623@ucsu.Colorado.EDU>, blanchad@rintintin.Colorado.EDU (BLANCHARD DAVID OWEN) writes:
[...]
> I have been using EVEPlus for years - EVEPlus was issued soon after
> TPU V1.  Many of the good features were incorporated into TPU V2.  The
> original rectangular box features, IMHO, are better in EVEPlus than in
> TPU V2.  In EVEPlus, the boxed are is in reverse video and ONLY the
> box is highlighted.

    Just curious, having not used  EVEPlus,  does  ALL the text in the
rectangular  box get highlighted?  Does it get highlighted as you move
the cursor around (effectively changing the rectangle on the fly)?  If
the answer is yes, how do they do it without incurring the performance
hit a previous followup alluded to?

    	-Ken
-- 
 Dr. Kenneth H. Fairfield    |  Internet: Fairfield@Slac.Stanford.Edu
 SLAC, P.O.Box 4349, MS 98   |  DECnet:   45537::FAIRFIELD (45537=SLACVX)
 Stanford, CA   94309        |  BITNET    Fairfield@Slacvx
 ----------------------------------------------------------------------------
 These opinions are mine, not SLAC's, Stanford's, nor the DOE's...
Newsgroups: vmsnet.admin
Subject: Re: NEW BBS PROGRAM
From: tp@mccall.com (Terry Poot)
Date: Tue, 22 Dec 1992 08:02:41 CST
Reply-To: tp@mccall.com (Terry Poot)
Organization: The McCall Pattern Co., Manhattan, KS, USA
Nntp-Posting-User: tp


I've informed the poster of this garbage that all future such messages to VMSnet
groups will be cancelled. Let me know if anyone thinks that's out of line.

>Newsgroups: most of them
>Subject: NEW BBS PROGRAM
>From: myron.krawczuk@hitech.newark.nj.us (Myron Krawczuk) 
>Date: 20 Dec 92 19:29:00 GMT
--
Terry Poot <tp@mccall.com>                   The McCall Pattern Company
(uucp: ...!rutgers!depot!mccall!tp)          615 McCall Road
(800)255-2762, in KS (913)776-4041           Manhattan, KS 66502, USA
From: jeh@cmkrnl.com
Newsgroups: vmsnet.admin
Subject: Re: NEW BBS PROGRAM
Date: 23 Dec 92 14:55:16 PST
Organization: Kernel Mode Consulting, San Diego, CA

In article <1992Dec22.080241@mccall.com>, tp@mccall.com (Terry Poot) writes:
> 
> I've informed the poster of this garbage that all future such messages to VMSnet
> groups will be cancelled. Let me know if anyone thinks that's out of line.
> 
>>Newsgroups: most of them
>>Subject: NEW BBS PROGRAM
>>From: myron.krawczuk@hitech.newark.nj.us (Myron Krawczuk) 
>>Date: 20 Dec 92 19:29:00 GMT
> --
> Terry Poot <tp@mccall.com>                   The McCall Pattern Company
> (uucp: ...!rutgers!depot!mccall!tp)          615 McCall Road
> (800)255-2762, in KS (913)776-4041           Manhattan, KS 66502, USA

Sounds fine to me!!!

	--- Jamie Hanrahan, Kernel Mode Consulting, San Diego CA
drivers, internals, networks, applications, and training for VMS and Windows-NT
uucp 'g' protocol guru and release coordinator, VMSnet (DECUS uucp) W.G., and 
Chair, Programming and Internals Working Group, U.S. DECUS VMS Systems SIG 
Internet:  jeh@cmkrnl.com, hanrahan@eisner.decus.org, or jeh@crash.cts.com
Uucp:  ...{crash,eisner,uunet}!cmkrnl!jeh
Newsgroups: gnu.chess,rec.games.chess
From: 928s4@leland.Stanford.EDU (Benjamin Sloss)
Subject: Re: GNU Chess ratings estimates...
Summary: depends on the hardware
Organization: DSG, Stanford University, CA 94305, USA
Date: Tue, 29 Dec 92 17:07:10 GMT

Tony-Preston@cup.portal.com (ANTHONY FRANCIS PRESTON) writes:
>I have the Amiga version of the GNU chess program and think it is pretty
>good.  My questions are 1) what are the estimates for rating strength(USCF?)
>versus the various time controls?  2) how deep will the search for moves
>go versus the time controls.  I am only looking for intellegent estimates!

  To estimate the strength of the program, it is necessary to know how fast
the program runs on your hardware.  Perform the following test:
* With the book turned off, set the time controls to some long interval
(say move/10 min) and set the search depth to 6 ('depth' <cr> '6' <cr>)
Turn on 'post' and then type 'go'.  Record the time it takes your machine
to calculate the 6-ply search for White's first move (it should get Nf3).

  Now, we need to make two assumptions.  The first is fairly well established:
every doubling of processor speed improves the program's play by roughly 75
points.  The second is a baseline rating for GNUChess, which I will 
estimate as 2300 on an RS/6000.  

  The RS calculates the search in 27 sec.  Thus, you can estimate the rating
of GNUChess on your Amiga by the formula 2300 - 75 * (log2(t) - log2(27))
where t is the number of seconds it took your machine to calculate the
search.

  In answer to your second question (depth of search vs time), the answer
depends greatly on the type of position being searched.  Endgames, with their
reduced piece count (and thus reduced movelist) are searched much deeper than
complicated middlegames, in a given amount of time.  Perhaps a more useful 
question is "my program searched n ply in time t; how long will it take
to search n+1 ply?".  The answer here is about 6t for middlegames, and
perhaps 3t for endgames.  This is again due to the differences in movelist
size (which averages 40 in the middlegame, much less in the endgame) and
the effeciency of the alpha-beta pruning algorithm.

-- 
Ben Sloss        Email: ben@osc.versant.com   Work: (415) 329-7500 x172
Quote:          "It's all fun and games until someone gets paid."
Transportation: '83 CB650SC (straight roads) '93 CBR 900RR   (twisty roads)
		'91 XR 250L (dirty    roads) '87 Mustang 5.0 (wet    roads)
Newsgroups: gnu.chess,rec.games.chess
From: jefouger@nyx.cs.du.edu (Jim  Fougeron)
Subject: Re: GNU Chess ratings estimates...
Organization: University of Denver, Dept. of Math & Comp. Sci.
Date: Thu, 31 Dec 92 04:58:53 GMT

monaghan@cac.washington.edu (Tracy Monaghan ) writes:


>Thanks for the formula for estimating GNUchess strength, but...

>For those of us who are mathematically-deficient, is there a formula
>which doesn't use log2 but makes use of log10, or ln (natural log), or
>barring that, some fanciful way of achieving log2 using log10 and/or ln?

log2(x) == (log10(x))/(log10(2))

Jim Fougeron jefouger@nyx.cs.du.edu
From: tmcconne@sedona.intel.com (Tom McConnell~)
Newsgroups: gnu.chess
Subject: Wrong "illegal move" pl58 and pl60
Date: 29 Dec 1992 15:44:23 GMT
Organization: Intel Corporation
Distribution: world
NNTP-Posting-Host: thunder.intel.com
Originator: tmcconne@sedona


  System: RS/6000, AIX-3.1
          gcc-2.3.3
          xboard-2.0.pl25
          gnuchess-4.0.pl60

  I get an "Illegal move" error from gnuchessx for good moves. The errors appear
to be random, but repeatable. Here is one example:

    thunder> xboard -size small -debug true 
    Received from first: Chess
    Sending to first: new
    beep
    random
    easy

    Received from first: transposition table is 131072
    Received from first: new
    Received from first: beep
    Received from first: random
    Received from first: easy
    Sending to first: e2e3

    Received from first: e2e3
    Received from first: 1. e2e3
    Received from first: 1. ... g8h6
    Sending to first: d2d4

    Received from first: d2d4
    Received from first: 2. d2d4
    Received from first: 2. ... e7e6
    Sending to first: f1d3

    Received from first: f1d3
    Received from first: 3. f1d3
    Received from first: 3. ... d8g5
    Sending to first: g1f3

    Received from first: g1f3
    Received from first: Illegal move (no matching move)g1f3

  The last move is white King's knight to white Bishop 3. This is a legal move,
but gnuchessx refuses to let me play it.

  This problem also shows up when xboard is told to play two machines, although
it usually takes longer.

  Another interesting item is that after the first game, after
"gnuchess.book.data" is written, gnuchessx just seems to hang. If you are
running "two machines", you get two gnuchessx processes running full blast,
but neither one actually makes a move. This does _not_ happen with pl58.

  Thanks for any help.

    Cheers,

    Tom McConnell
-- 
 Tom McConnell          |     Internet: tmcconne@sedona.intel.com
 Intel, Corp. C3-91     |     Phone: (602)-554-8229
 5000 W. Chandler Blvd. | The opinions expressed are my own. No one in 
 Chandler, AZ  85226    | their right mind would claim them.
Xref: sparky gnu.chess:507 rec.games.chess:12131
From: monaghan@cac.washington.edu (Tracy Monaghan )
Newsgroups: gnu.chess,rec.games.chess
Subject: Re: GNU Chess ratings estimates...
Date: 30 Dec 1992 00:04:57 GMT
Organization: UW Computing
NNTP-Posting-Host: red1.cac.washington.edu


Thanks for the formula for estimating GNUchess strength, but...

For those of us who are mathematically-deficient, is there a formula
which doesn't use log2 but makes use of log10, or ln (natural log), or
barring that, some fanciful way of achieving log2 using log10 and/or ln?

Or, if someone just happens to know the estimated rating of GNUchess 4pl60
on a DECstation 3100...
Newsgroups: gnu.chess,rec.games.chess
From: lwloen@rchland.vnet.ibm.com (Larry Loen)
Subject: Re: GNU Chess ratings estimates...
Date: Wed, 30 Dec 1992 22:59:21 GMT
Reply-To: lwloen@rchland.vnet.ibm.com
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Organization: IBM Rochester

In article <1hqp39INNilh@shelley.u.washington.edu>, monaghan@cac.washington.edu (Tracy Monaghan ) writes:
|> 
|> Thanks for the formula for estimating GNUchess strength, but...
|> 
|> For those of us who are mathematically-deficient, is there a formula
|> which doesn't use log2 but makes use of log10, or ln (natural log), or
|> barring that, some fanciful way of achieving log2 using log10 and/or ln?
|> 
|> Or, if someone just happens to know the estimated rating of GNUchess 4pl60
|> on a DECstation 3100...

The conversion is available in a lot of mathematics books.  If memory serves,
converting works as follows:

     x = log to base 2 of (some expression or other).

    x*ln(2)/ln(10) produces the value of x as a base 10 logarithm.    

    If y is not "logged" yet.  That is:

     y  =  (some expression or other)

    then the base 10 logarithm is it is ln(y)/ln(10)

where "ln(z)" is the natural log of z.


Anyway, that's what MS DOS basic shows me.

-- 
   Larry W. Loen        |  My Opinions are decidedly my own, so please
                        |  do not attribute them to my employer
Newsgroups: gnu.chess
From: ccecks@nuscc.nus.sg (Chua Kong Sian)
Subject: Free first move for white
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Date: Tue, 22 Dec 1992 07:19:10 GMT


I like to make a suggestion.  Let the first move for white be free. 
Currently once you have loaded up gnuchess, the program starts the timing
and by the time you've type in all the post, beep, help, hash, bla bla
stuff, probably 20-30 secs have gone by.  This shouldn't the so.  

Chua Kong Sian
National University of Singapore
Xref: sparky gnu.chess:512 rec.games.chess:12147
From: hoffmann@rwzl01.zld.rws.nl (Rob Hoffmann)
Newsgroups: gnu.chess,rec.games.chess
Subject: Re: Steve Martin:  Fischer fan
Summary: Steve Martin plays chess?
Date: 30 Dec 92 09:07:02 GMT
Followup-To: rec.games.chess
Organization: Dutch Min. of transport Zeeland, Middelburg

In article <1hqqb0INNej7@agate.berkeley.edu>, jeff@emily10.Berkeley.EDU (Jeffrey C. Ely) writes:
> The San Francisco Chronicle tells me that Steve Martin, in an interview in
> Playboy, admits to having asked for only three autographs in his entire life.
> One of the three was Bobby Fischer, whom he calls " a legendary genius."

Allright, but does Steve Martin play a decent game of chess?
Newsgroups: gnu.chess
From: peterg@acci.com.au (Peter Gill)
Subject: GNU Chess for Amiga 
Keywords: GNU CHESS 
Reply-To: peterg@acci.com.au
Organization: Australian Computing and Communications Institute
Date: Tue, 29 Dec 1992 22:17:14 GMT

Hi. Just wondering if anybode knows whether GNU have a version if chess for the Amiga 500 O/S 1.2 or 1.3


Thanks
___________________
Regards, Peter GIll
peterg@acci.com.au
+61 3 282 2506
Xref: sparky gnu.chess:508 rec.games.chess:12132
From: jeff@emily10.Berkeley.EDU (Jeffrey C. Ely)
Newsgroups: gnu.chess,rec.games.chess
Subject: Steve Martin:  Fischer fan
Date: 30 Dec 1992 00:26:08 GMT
Organization: Dept. of Statistics, U. C. Berkeley
NNTP-Posting-Host: emily10.berkeley.edu

The San Francisco Chronicle tells me that Steve Martin, in an interview in
Playboy, admits to having asked for only three autographs in his entire life.
One of the three was Bobby Fischer, whom he calls " a legendary genius."
From: Tony-Preston@cup.portal.com (ANTHONY FRANCIS PRESTON)
Newsgroups: gnu.chess
Subject: GNU Chess ratings estimates...
Date: Mon, 28 Dec 92 12:56:53 PST
Organization: The Portal System (TM)

I have the Amiga version of the GNU chess program and think it is pretty
good.  My questions are 1) what are the estimates for rating strength(USCF?)
versus the various time controls?  2) how deep will the search for moves
go versus the time controls.  I am only looking for intellegent estimates!
Newsgroups: gnu.chess,rec.games.chess
From: lumme@polaris.utu.fi (Mikael Lumme)
Subject: Re: GNU Chess ratings estimates...
Organization: University of Turku
X-Newsreader: Tin 1.1 PL5
Date: Wed, 30 Dec 92 09:03:11 GMT

Tracy Monaghan (monaghan@cac.washington.edu) wrote:
: 
: Thanks for the formula for estimating GNUchess strength, but...
: 
: For those of us who are mathematically-deficient, is there a formula
: which doesn't use log2 but makes use of log10, or ln (natural log), or
: barring that, some fanciful way of achieving log2 using log10 and/or ln?


             log10(x)        ln(x)
log2(x)  =   --------   =    -----
             log10(2)        ln(2)
Newsgroups: gnu.chess
From: ashish@tfs.com (Ashish Mukharji)
Subject: Bug in gnuchess-4.0.pl60
Summary: can't castle
Organization: TRW Financial Systems
Date: Thu, 31 Dec 1992 03:49:45 GMT

I just got this compiled - it seems to get confused in a variety of
ways when one of us has to castle - particularly queenside - about 25%
of the time.  Has anyone seen this before?  I'm not sure whether the
bug is in gnuchess or in the xboard interface.  Fixes appreciated - I'd
rather spend my time doing something interesting like typing in opening
lines.

I've been using "gnuchessr" to practise my blindfold chess.  Scored my
first win against it yesterday - at 40/10 on a SUN 4/600.  I'm about
2050 USCF and probably a class F blindfold player, which makes me *really*
suspicious of rating estimates in the 2300's.  (Ok, so I had to peek to
find the mating combo, but still ...)  Comments?  The program seems ok
tactically, but it has no positional "understanding" whatsoever.

-ashish

-- 
Ashish Mukharji      Jesus he knows me, and he knows I'm right,
ashish@tfs.COM       I've been talking to Jesus all my life ...    Genesis
From: fermat@fermat.dartmouth.edu (Michael Glenn)
Newsgroups: gnu.chess
Subject: Gnuchess infinite loop?
Date: 30 Dec 92 05:49:27 GMT
Organization: Dartmouth College, Hanover, NH


I've tried compiling gnuchess4.0.pl60 with gcc 2.3.3, and I consistantly  
get an infinite loop (usually after 4-5 seconds of successful operation).   
It happens around line 54 of atak.c in the loop

          do
            {
              a[u] = ((a[u]+1) | c);
              u = ((color[u] == neutral) ? ppos[u] : pdir[u]);
          } while (u != sq);

Obviously u never gets to equal sq here.  Anyone else have such a problem,  
or is this old news?

Michael Glenn
From: glickman@hustat.harvard.edu (Mark Glickman)
Newsgroups: gnu.chess
Subject: Need xboard compiled for Sun Sparc 2 running SunOS 4.1.2
Date: 25 Dec 92 14:21:35 GMT
Originator: glickman@hustat

For those of you are still in that holiday giving mood, could 
you possibly send me a compiled copy of xboard to run on
a Sun SparcStation2 running SunOS 4.1.2?  I'd really
appreciate it.  The source won't compile on my machine
because the X files on our machine are not in standard
directories.

Thanks!

             - Mark Glickman
Newsgroups: gnu.gnusenet.test