[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: Leibniz

To: computer-go@xxxxxxxxxxxxxxxxx
Subject: Re: computer-go: Leibniz
From: Richard Brown <rbrown@xxxxxxxx>
Date: Wed, 16 Oct 2002 11:43:29 -0500
References: <LNEAJDAOOLCMMFDDHIDJCECGCJAA.russw@xxxxxxxxxxxxxxxxx> <3DAAD06A.9080001@xxxxxxxxxxxxxxxxx> <004d01c273b7$7e536840$e0e36c42@xxxxxxxxxxxxxxxxx>
Reply-to: computer-go@xxxxxxxxxxxxxxxxx
Sender: owner-computer-go@xxxxxxxxxxxxxxxxx
User-agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:1.0.0) Gecko/20020530

Peter Shotwell wrote:

There is some material in The Go Player's Almanac 2001. Apparently he didn't
know the rules so he speculated on how the game was played.
If anyone has further information than this article, I would love to know
it!

O.k., Peter, your prayers have been answered.

See  <http://www.gozillago.net/misc/LeibnitzOnGo.pdf> .

It has Dutch, German, French, and the original Latin.

The Dutch and German versions seem to be extracts from the longer
(French or Latin) article.

Now you have only to translate it into English.

If you do, can you send me a copy, or post it on the web, or an ftp site?

--
Richard L. Brown       Office of Information Services
Unix Guy               University of Wisconsin System Administration
                       780 Regent St., Rm. 246
rbrown@xxxxxxxxxxxxxxxxx        Madison, WI  53715

References:
- RE: computer-go: [ANN] Computer Go - An international bulletin...
  - From: Russ Williams
- Re: computer-go: [ANN] Computer Go - An international bulletin...
  - From: Richard Brown
- computer-go: Leibniz
  - From: Peter Shotwell

Prev by Date: Re: computer-go: How many bits are needed to encode an N x N Go position?
Next by Date: computer-go: Fwd: Re: [Fwd: Stanford Colloq: QUANTITATIVE GO, AND SOME OTHERCOMBINATORIAL GAMES * 4:15P...] (fwd)
Previous by thread: computer-go: Leibniz
Next by thread: computer-go: 5 x 5 perfect play
Index(es):
- Date
- Thread