Many Faces has a joseki database with about 64000 corner positions. It's
stored as a DAG, not a set of patterns, so it can't find transpositions.
Just curious: why don't you convert the DAG into patterns at program
initialization?
___
Olivier and David both: a huge thank you for sharing your secrets.
I think David makes clear that his large patterns apply only to the UCT
process, and
then only after a significant number of trials are reached. I gather that
the lifecycle
of a node is something like this in MFGO:
1)
Orego has been doing well in 9x9 games on KGS, using the fast time
controls of this weekend's upcoming tournament. I even improved the
endgame behavior a bit: Orego will pass if (a) the opponent has passed
first, and (b) after removing Orego's dead stones, but not the
opponent's, Orego
Is there no way for the bot to dispute the other player's decision?
I recall something of the sort in human-to-human play -- both have to agree
before the scoring phase.
I do not know whether the KGS API works the same way.
Terry McIntyre terrymcint...@yahoo.com
And one sad servitude alike
This comes up from time to time on this list. Rated games require the
human to accept what the bot says (but can undo to continue play). In
free games the bots must accept what the human says.
Sent from my iPhone
On Sep 17, 2009, at 5:27 PM, terry mcintyre terrymcint...@yahoo.com
wrote:
Got it -- thanks!
Peter Drake
http://www.lclark.edu/~drake/
On Sep 17, 2009, at 3:55 PM, Jason House wrote:
This comes up from time to time on this list. Rated games require
the human to accept what the bot says (but can undo to continue
play). In free games the bots must accept what the
Pretty close. Rave is accumulated for every trial (I don't want to throw
away useful information). N depends on the board size. K N and the ratio
is not fixed. I use progressive widening, and I'm curious what the widening
formula is for other programs, or how slowly it increases.
From:
I created the joseki database for the DOS program when typical computers had
1 MByte of memory. It's stored in a highly compressed format using 10 bits
per node in the DAG (each node has x and y coordinate and an indication of
the type of joseki: good/bad/trick/followup, and an indication if it
