scoring.
Terry McIntyre
UNIX for hire
software development / systems administration / security
- Original Message
From: Christian Nilsson [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Friday, December 22, 2006 12:46:40 PM
Subject: Re: [computer-go] Anchor Player
Yes
Here's John Tromp's reply: he does not specify compensation for handicap stones
- but leaves wiggle room for the players to choose such komi as they wish.
- Forwarded Message
From: John Tromp [EMAIL PROTECTED]
To: terry mcintyre [EMAIL PROTECTED]
Sent: Saturday, December 23, 2006 4:25
The PS3 is a bit starved for memory - 512 megabytes, half seems to be for
video, half for the main CPU.
I just got a PS3 and hope to do some exploration with Linux programming. My own
personal supercomputer :D
Terry McIntyre
UNIX for hire
software development / systems administration
be expected to make four quad-cores
available by
the end of the year. Both Intel and AMD have announced multicore roadmaps.
Less
well-known processors, such as Sun's UltraSparc T1, have 8 cores and up to 32
simultaneous threads.
Terry McIntyre
- Original Message
From: steve uurtamo [EMAIL
Terry:
Several on this list have experimented with concurrent processing -
can you share any overall summary of your results? How well does
the problem scale? Any advice?
Sylvain:
The results I have so far are very simple. I have a very (very)
simple concurrent implementation of UCT. With
suspect.
-- Terry McIntyre
- Original Message
From: Chris Fant [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Friday, January 12, 2007 8:16:35 AM
Subject: Re: [computer-go] Can Go be solved???... PLEASE help!
Seems like a silly title. Any game of perfect
A much more up-to-date bibliography is maintained by Markus Enzenberger:
http://www.cs.ualberta.ca/~emarkus/compgo_biblio/
Terry McIntyre
Bored stiff? Loosen up...
Download and play hundreds of games
to define
differences in terms of handicap stones, which is more familiar to most Go
players than elo points. On the downside, it appears to depend on a very small
set of games, does not preserve all game records, and operates on a glacially
slow timescale.
Terry McIntyre
UNIX for hire
with multiple
processes, and the recent results on memory-efficient monte carlo algorithms,
perhaps this tradeoff would work to the computer's advantage.
Terry McIntyre
- Original Message
From: [EMAIL PROTECTED] [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Cc: computer-go@computer-go.org
A lot of this interesting discussion has been about whether humans can make use
of extra time. Some participants ( such as Dave Devos ) believe that, after a
certain point, humans cannot
improve their rank, at least not linearly with respect to time alloted. Fair
enough; we humans require
From: Don Dailey [EMAIL PROTECTED]
On Mon, 2007-01-22 at 03:43 +0100, alain Baeckeroot wrote:
The few games i played against mogobot on 19x19 shows that it does not
know overconcentration. And i can safely bet that increasing
thinking time will not solve this,
By definition, a scalable
On Tue, 2007-01-23 at 16:53 -0500, Don Dailey wrote:
It's obvious that you can't program a 10 instruction per second
computer to beat a human - so it's also clear that there would
be some minimum level of hardware required.
Let's not forget VLIW ( Very Long Instruction Word ) computers,
by experts is quite small.
On 24, Jan 2007, at 9:17 AM, terry mcintyre wrote:
does this approach what a Meijin does with a large fraction
of 10^15 neurons all working in tandem?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer
, terry mcintyre wrote:
does this approach what a Meijin does with a large fraction
of 10^15 neurons all working in tandem?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go
Go, being a matter of efficiency over one's opponent, may be even more
susceptible to improvement via many small improvements over many moves than is
chess. As long as you don't leave weak shapes behind, picking up a point here,
a point there at a slightly faster rate than your opponent will
let's step back a bit and define terms. How do we define a linear improvement
in Go?
Would that be a linear increase in ELO points, or what?
Terry McIntyre
Want to start your own business?
Learn how
- Original Message From: Don Dailey [EMAIL PROTECTED]
This can be tested directly. In my own experiments 19x19
improves very rapidly in UCT with each doubling of the
number of play-outs.
May I ask the range of number of playouts tested?
Have you considered taking up David
- Original Message From: Don Dailey [EMAIL PROTECTED]
May I ask the range of number of playouts tested?
I'm still curious about this question?
Part of my procrastination [ about using 72 processors ] is that
I'm not sure how to make UCT scale to a large number of CPU's.
I am an
Found a recent article on computer Go in the IEEE Computer journal.
pdf here: http://csdl2.computer.org/comp/mags/ex/2007/01/x1005.pdf
The author is Jan Krikke. title The Challenge of Go
Terry McIntyre
[EMAIL PROTECTED
From: David Doshay [EMAIL PROTECTED]
I think that SlugGo shows rather well that some algorithms do not
scale well. SlugGo gives GNU Go about 72 times as much thinking, and
while it could be argued that some of our heuristics and evaluation
functions sometimes lead us to make worse moves, in
I concur with the preference for a mailing list. As for yahoogroups, I'm
involved in several of those, and they are spam magnets.
Terry McIntyre
On Mon, 2007-02-05 at 03:17 +0300, Dmitry Kamenetsky wrote:
Why can't we use proper forums instead of this outdated list?
Forums are easier
If I recall correctly, someone spoke of constraining the opening moves to the
3rd,4th,and 5th lines in the absence of nearby stones, or something to that
effect. What was the impact of this experiment? I notice the recent discussion
of the need for a lot of thinking time to find good opening
What sort of sampling was used for the playouts? For this variable (
incorporating some information about the score vs only the win-loss variable ),
does it make a difference whether playouts are totally random or incorporate
varying degrees of similitude to good play?
From: [EMAIL PROTECTED]
regardless of whether they
are known to be good, have been refuted, or are of indeterminate status.
What am I missing?
Terry McIntyre
- Original Message
From: Nick Apperson [EMAIL PROTECTED]
If it only did one playout you would be right, but imagine the following cases:
case 1: White wins
Thanks, Peter! I have a question or two regarding the opening book, based on a
collection of 3000 9x9 games provided by Nici Schraudolph. Who played the games
in this collecton - pros, strong amateurs, or go programs?
Second, were any statistics on the number of game moves in book versus
Now that's low traffic! One post in May of 2006, and since then, nada. No
spambots, no griefers. :)
Terry McIntyre
-Original Message-
From: Joshua Shriver [EMAIL PROTECTED]
To: Dmitry Kamenetsky [EMAIL PROTECTED], computer-go
computer-go@computer-go.org
Date: Wed, 7 Feb 2007 09:35:54
Is this opening book database used for the UCT portion, or the playout portion
of Orego? In the UCT portion, speed of access may not be that important; a
database would probably be ideal. If used during the playout, then speed of
access is more crucial.
Terry McIntyre
UNIX for hire
software
Not only shiko, but many joseki depend on properties of the edges and corners.
On a torus, there are no edges or corners.
Terry McIntyre
From: David Doshay [EMAIL PROTECTED]
Playing on a torus changes ladders too!
Cheers,
David
On 20, Feb 2007, at 9:29 AM, Don Dailey wrote:
I wonder how
on a pentium; there
are many such engines on each FPGA array, operating in parallel.
As for video cards, providing one can map the algorithm to the parallel
hardware, one may also see considerable speedups. Of course, that three-letter
word map hides a good bit of intellectual heavy lifting.
Terry
Any possibility of running out of memory? Linux will kill processes sometimes
if there's not enough memory.
- Original Message
From: Hideki Kato [EMAIL PROTECTED]
To: [EMAIL PROTECTED]; computer-go computer-go@computer-go.org
Sent: Monday, March 12, 2007 4:48:16 AM
Subject:
This may be an instance where bitmaps would be handy - altho expensive in terms
of memory - a bitmap would require NxN bits for each string of connected stones.
For each connected string, maintain a bitmap of adjacent liberties. When two
strings are connected, add the two bitmaps together -
Sylvain,
Were you aware of this challenge from the American Go Association? The
following is from the latest AGA newsletter; you can send corrections or
replies to [EMAIL PROTECTED]
GO ONLINE: MoGo -- No-Go, So-So or Uh-Oh?
Go has been called The fruit fly of IT, and for a good reason --
It is a good idea to write a press release with the key points laid out in the
form of an article. Quote yourself in your press release - Go Researcher
Sylvain Gelly said yadda yadda. Many published articles are almost direct
copies of press releases. This way, you can encourage more accurate
If both Monte Carlo players strive for 0.5 point wins, then almost any ballpark
komi would lead to a 50/50 split, a sort of self-fulfilling prophecy?
What happens when a player sets a more difficult komi than the one used for
scoring? Sometimes Go players use larger komi as a sort of handicap.
From: Sylvain Gelly [EMAIL PROTECTED]
Sent: Wednesday, April 11, 2007 12:59:57 AM
Subject: Re: [computer-go] The dominance of search (Suzie v. GnuGo)
On KGS, 9x9, MoGo uses about 40s per move, and on 19x19 (when rated 4kyu)
used 15s per move.
It would be interesting to see how MoGo does
Humans don't have much experience with 9x9 go. In such tight confines, there is
a premium for precise reading; there is little margin for error. It is much
harder to escape, and harder to trade territory for influence. There is also,
as Dave Fotland observed, little established literature on
From: Darren Cook [EMAIL PROTECTED]
The best source of 9x9 professional games is the Mini-go TV series,
which finished a few years back, but should have close to 700 games if
you can track down the complete set.
Where would one begin to track down this show?
There is even a book published of
An advantage of speed go for computers is Moore's Law: as processors improve,
computers do more work in a given time. No such law applies to human brains. It
is reasonable to expect a doubling in computer go performance every eighteen
months or so - perhaps more so with the trend to multicore
I have a dual-core AMD64 which is unused and connected to the internet for a
most of the day, and would be delighted to volunteer it for running an instance
of a 19x19 go program for cgos.
Terry McIntyre
UNIX for hire
software development / systems administration / security
[EMAIL PROTECTED
.
Terry McIntyre
UNIX for hire
software development / systems administration / security
[EMAIL PROTECTED]
- Original Message
From: Don Dailey [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Monday, May 21, 2007 3:58:18 PM
Subject: Re: [computer-go] 9x9 vs 19x19
ok. Will set up the min and max parameters as per email from DRD.
Terry McIntyre
UNIX for hire
software development / systems administration / security
[EMAIL PROTECTED]
- Original Message
From: Don Dailey [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Tuesday, May
I'd have to read the paper to make sure I understand what's being done, but to
my ears,
progressive widening is more natural and descriptive than progressive
unpruning.
Terry McIntyre
UNIX for hire
software development / systems administration / security
[EMAIL PROTECTED]
- Original
From: George Dahl [EMAIL PROTECTED]
Does anyone know of any open source Go AI's written in pure python?
http://senseis.xmp.net/?SimpleGo - early versions appear to have been pure
python.
later versions use a mix of python and c for the monte carlo bits where
performance matters.
From the www page, this python effort actually does use Lukasz' libraries for
efficiency.
From: Don Dailey [EMAIL PROTECTED]
I don't believe this is a truly workable model. It's often stated as a
fundamental working model (especially for language advocates of tcl,
ruby, python, etc.) but in
to help establish rankings. So if
you've got a hot Monte Carlo bot that you'd like to run through the paces,
send me the executable ( my box is a Linux 64 bit AMD ) and I'll fire up a
client.
First come, first served.
Terry McIntyre
UNIX for hire
software development / systems administration
Azul Systems has released a compute appliance with 768 cores and 768
gigabytes of RAM,
happily driving your Java applications faster than ever before:
http://www.azulsystems.com/products/compute_appliance.htm
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern
?
The systems appear to be very energy efficient also. They run at slower memory
speeds, depending
more upon the massive parallelism of 48 cores per chip than raw clock speed.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean
Regarding the garbage collector, Azul Systems' big selling point is that their
hardware-assisted
garbage collection consumes vastly less time and is much more predictable.
- Original Message
From: Álvaro Begué [EMAIL PROTECTED]
Then you have the garbage collector, which will run at
Now that takes me back to days of your. Can we run TECO on a PDP-10 emulator?
Early
versions of EMACS were actually written on top of TECO -- how's that for layers
upon layers
of emulation?
http://en.wikipedia.org/wiki/Text_Editor_and_Corrector
- Original Message
From: Dave Dyer
From: Heikki Levanto [EMAIL PROTECTED]
I still think it a bit strange that on an empty board, a program can
prefer a 3-3 point in one corner, and in another corner find it quite
unplayable.
It makes sense of the space evaluated by the random playouts differed. But my
thinking
is, what if
that one need not sweat each and
every end-game move.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From: Don Dailey [EMAIL PROTECTED]
To: computer-go
From: Don Dailey [EMAIL PROTECTED]
On Tue, 2007-06-19 at 11:27 -0700, steve uurtamo wrote:
I also don't like having to account for move numbers. It's ok if the
computer is tracking this such as online sites, but it's a pain
remembering and keeping up with move numbers in games played on physical
. That would be something of
a milestone, trouncing strong human players on the 9x9 board, with no excuses
about the humans running out of time.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters
From my experience, DGS is not comparable to correspondence chess; it isn't
anywhere near that competivive. It is generally a way to play a casual game
over a longish period of time.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
Dragon Go Server does have some sort of wrapper which enables programs to
connect to the server.
For a while, Gnugo was a participant on DGS. Last I checked, it was using .NET,
but they may have other
options by this time.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well
or Go? In a sense,
it might be considered a striving for kami no itte - the hand of god or the
perfect play.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
the advantage of a five stone handicap.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
I am seeing messages like this:
02:27:59Irrecgular response from server. Breaking connection.
02:27:59Connection to server has closed. Will try to reconnect shortly.
Am restarting my 19x19 client.
Anyone else having similar issues?
Terry McIntyre [EMAIL PROTECTED]
They mean to govern
what's up with the 19x19 server? haven't been able to connect for a couple days.
Error message: 08:05:47Irrecgular response from server. Breaking connection.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean
From: Don Dailey [EMAIL PROTECTED]
The appears to be a bug with CGOS, please bare with me
But we hardly know ye! Isn't it a bit early to get bare with you? ;)
In all seriousness, thanks for restarting the server. Cheers!
the handicap information and the win-loss
percentages into a unified ELO-type score? Would an experiment be needed to
measure the effect of handicap stones on the probability of winning?
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters
From: Don Dailey [EMAIL PROTECTED]
Is it possible to tie together the handicap information and the
win-loss percentages into a unified ELO-type score? Would an
experiment be needed to measure the effect of handicap stones on the
probability of winning?
I think the common formula is 100
- Original Message
From: Chris Fant [EMAIL PROTECTED]
BTW I have no idea what IGGA means, International Guild Of Glass
Artists, International Grooving and Grinding Association,
International Gomputer Games Association, is it a typo???
No, gomputers are real:
- can't
speak to that.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From: Robert Jasiek [EMAIL PROTECTED]
To: computer-go computer-go@computer
that checkers,
played perfectly, results in a draw.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From: Álvaro Begué [EMAIL PROTECTED
An interesting recap of how the hype can sometimes far outpace the reality:
http://www.cs.ualberta.ca/~chinook/project/legacy.html
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel
From: Ian Osgood [EMAIL PROTECTED]
On Jul 20, 2007, at 2:25 PM, Andrés Domínguez wrote:
2007/7/20, Ian Osgood [EMAIL PROTECTED]:
My program disallows playing in eyes (string of empty surrounded
by self)
unless a neighboring stone is in atari. That catches your special-
case, but
is not
, and superko are
prohibited. Available moves eventually diminish to zero. The person with the
smallest territory loses, unable to make a legal move.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters
I tried to start this version of Drago, and got an error message regarding a
missing libkombilo.dll
I do have an earlier version of Drago which works, modulo the problems with
Mogo.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
I looked at the cgos game records, and it shows the most recent n games. I was
looking for games by Mogo,
which did not appear in that list at the time I checked.
How do I find games played by a particular program?
Thanks!
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well
cannot connect to the 19x19 server. This happens
periodically.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
If you specify the name without the path, it doesn't know where to look. If you
use find file, you are specifying the full path.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
ROTFLMAO!
Years back, I had the assignment of writing a compiler for a subset of C. A
temporary come from opcode expedited the generation of assembler code. My
professor, fortunately, had a sense of humor.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern
- Original Message
From: Don Dailey [EMAIL PROTECTED]
I think [Hsu] is betting on null move proving - but I'm real skeptical that
it will be effective in Computer Go. It will indeed reduce the tree
significantly, but this comes at a qualitative price that is not so bad
in Chess but
From my conversations with dan-level players, analysis in the fuseki is not
broad. They'll consider a handful of moves at any point - should I play in the
open corner first, or respond to an approach move, or make my own approach
move? Candidate moves are chosen from a small set of patterns -
and the
prediction of pro-level moves. I've always wondered whether that could be
integrated with UCT to narrow the search tree.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original
This may be the same Chris Rosin:
http://www.cs.wisc.edu/areas/ai/aisem/abstracts/1995.2.summer/rosin.html
http://www-cse.ucsd.edu/users/crosin/
Other than the senseis.xmp reference, I have been able to google nothing about
greenpeep.
Terry McIntyre [EMAIL PROTECTED]
- Original Message
- Original Message
From: Don Dailey [EMAIL PROTECTED]
My point is that this probably won't happen in computer Go but it
happened long ago in computer chess.
- - Don
Can you point us to info about comparable agency for computer chess? Who funds
such an agency?
Thanks!
I'd say that the CGOS server has been an invaluable spur to development, since
it does allow fairly easy testing against the competition.
What Don seems to be proposing is a way of standardizing the hardware - all
programs run on the same platform.
It seems that this would require an
From: Christopher Rosin [EMAIL PROTECTED]
Christopher, Thanks for your explanation of greenpeep!
megasnippage
- Biasing playouts by patterns is much better than unbiased playouts
- Playouts using self-play patterns together with MoGo-style move
preferences (favor defensive moves and
From: Dave Dyer [EMAIL PROTECTED]
Considering how monte carlo actually works, I think it's plausible
to argue that it works best where the distance to endgame is small.
For a 19x19 board, the playing speed may be only a factor of 4 worse,
but the effective learning speed for an opening
http://stat.cs.tu-berlin.de/~ralfh/go.ps.gz
Thore Graepel, Mike Goutrie, Marco Krüger, and Ralf Herbrich used an SVM to
predict moves from pro games; it was particularly successful for predicting
opening moves, as I recall.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well
This may be more apropos:
http://www.icml2006.org/icml_documents/camera-ready/110_Bayesian_Pattern_Ran.pdf
IIRC, the team attempted to match patterns all throughout the game, but had
more success in the opening.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean
What is used in Asia?
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From: Ian Osgood [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Less than 20 minutes per side would be practically blitz speed.
- Original Message
From: Chris Fant [EMAIL PROTECTED]
I oppose more time per side.
On 10/23/07, Christoph Birk [EMAIL PROTECTED] wrote:
On Tue, 23 Oct 2007, Olivier Teytaud wrote:
I'd argue that 30 minutes is a good compromise.
Among humans, that would be a brisk pace but not blitz - common time controls
are 60 or 90 minutes, and much longer for some pro tournaments.
For computers, 30 minutes should give enough time to bump up the standard of
play a few more kyu, while
for those who want results more quickly.
Many thanks to Don and everyone else for making CGOS possible!
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
From: Peter Drake [EMAIL PROTECTED]
Opinions may differ as to what counts as fast, but Java may be your best
choice here.
(Hint: double your speed by using the -server command-line option.)
I googled java option server and found this tidbit which goes into more
detail:
quote
In the
refers to his efforts to apply genetic algorithms to the game of Go,
but that's all I've been able to google so far.
Terry McIntyre [EMAIL PROTECTED]
Get easy, one-click access to your favorites.
Make
Go-specific language? Sprinkle in a few Common Lisp macros, stir well ...
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From: Vlad Dumitrescu [EMAIL
A bird's-eye view of computer-Go programming: a large part of what a Go program
does will probably be some sort of analysis of a deep tree of possible moves,
involving the exploration of millions of possible positions. The guts of this
should be as optimal as possible. A slower language such as
A set of custom masks for ASICs does not come cheap. You may wish to look into
Mosics,
http://www.cedcc.psu.edu/mse97/msedocs/paper8.pdf for a relatively low-cost
source for custom prototypes.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise
Sluggo was the only computer participant in the Cotsen Open. David Doshay used
a Mac with 8 cores; he'll have the results.
If I recall correctly, it did not do as well as previously, when it ran on 24
Mac Minis.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean
From: Nick Wedd [EMAIL PROTECTED]
In message [EMAIL PROTECTED], Petr Baudis
[EMAIL PROTECTED] writes
are there any limits (set by either rules or ethiquette) on power of
the machines running the bots? Or noone cares? I wonder if it's ok to
use a 16-core opteron-packed machine to run the bot
Some of the MonteGNU code was just released on CVS. Check out Gnugo's
development pages.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
- Original Message
From
back, to the surrounding and cutting and eye-killing moves which ultimately led
to the placement move.
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
From: terry mcintyre [EMAIL PROTECTED]
For a large number of playouts, the estimated scores should converge as the
game progresses. This is particularly true if the random distributions strongly
favor moves where each opponent monotonically increases the score - keeping
one's groups alive
Any estimate of winning probability is only as good as the estimates of whether
particular games are actually won or lost.
Evidently, even strong programs fail to recognize the impact of nakade, which
will alter the score not by one point, but by ten or twenty. Their estimate of
winning
From: Nick Wedd [EMAIL PROTECTED]
which will alter the score not by one point, but by ten or twenty.
Their estimate of winning probability is totally wrong. Good players
winnow out losing moves and stick with good moves - the basic premise
of minimax searching. Losing a big group will lead to a
and Xmas presents to celebrate
for this move and the next until ...
Ooops! Is my witty bitty group dead? Whatever were we thinking?
Terry McIntyre [EMAIL PROTECTED]
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
1 - 100 of 392 matches
Mail list logo
