🚀 go-pugleaf

 In article <1990Aug30.1...@nmt.edu> dbr...@nrao.edu (Daniel Briggs)
> writes about the difficulty of writing a Go-playing program.
	Cross-posting to rec.games.go might have some value.
	I know GNUGO is out there.  On a recent plane trip, the guy
	sitting behind me turned out to be a fellow Cornellian
	heading out to Boulder for a Go tournament; he was of the
	opinion that, while computer go was improving, it was still
	nowhere near human abilities, and tended to play random and
	ugly-looking games.  (I'm in no position to say; I stopped
	playing at about 25 kyu, and commented at a recent Usenix
	computer go tournament that one of the contestants obviously
	passed the Turing test - it was playing as badly as I would :-)
 
In article <15...@front.se>, p...@front.se (Per Lindberg) writes:
> I quote from HAKMEM (MIT AI MEMO 239, February 29, 2972). The section

Does anyone know if HAKMEM is available on-line?  I had a copy a few
years back; there were a number of interesting mathematical and
algorithm-related problems, some insight into the state of the art
back then, and (unfortunately) a lot of what purported to be
interesting algorithms written in highly legible PDP-10 assembler.
ARRRGH - as with Knuth, why can't people use ALGOL instead of
preferring low-level languages?  Admittedly, some of the algorithms
were really concerned with "how to make a 36-bit machine do
something useful?"

				Bill
-- 
					Thanks; Bill
# Bill Stewart 908-949-0705 erebus.att.com!wcs AT&T Bell Labs 4M-312 Holmdel NJ

# There'll be a brand new war coming soon to a theatre near you - promise!