Darren Cook wrote:
I've been messing around with where to apply heuristics. Candidates
include:
1) In the UCT tree, since this is earliest in each playout.
2) In the moves beyond the tree ("heavy playouts"), since this is where
most of the moves happen. Because this part is so speed-critical, ..
Peter Drake wrote:
On Jun 6, 2007, at 2:41 PM, Rémi Coulom wrote:
Also, if you have a clever probability distribution, the range of
values for each move will be very large. For instance, here are two
3x3 shapes used by Crazy Stone (# to move):
O O #
# . .
# O #
Gamma = 143473;
. # #
.
Thank you for your ideas.
The shapes Rémi is using have values as high as 143473. Of course, that
would invalidate my idea. But I planned trimming the upper probability to
a reasonable number, say 100 as scaling everything to a 1..100 scale (in
the runtime database). I don't know yet if that make
I noticed there is almost no activity on the 19x19 server.
I don't have the computing power to run bots on both servers, but I
remember there were some volunteers.If someone would run "Dog" for
me, I would appreciate it. It's a linux program statically linked I
think. It is running about 140
I'll run Dog if you send me the binary.
I have a 3ghz P4 w/ HT online 24/7
-Josh
On 6/7/07, Don Dailey <[EMAIL PROTECTED]> wrote:
I noticed there is almost no activity on the 19x19 server.
I don't have the computing power to run bots on both servers, but I
remember there were some volunteers.
Jacques Basaldúa wrote:
Rémi, are your values the result of learning in masters games?
Yes. I took data from a learning experiment based on very few games. So
there may be a little overfitting. Still, the ratio between the
strongest and the weakest patterns is always very big.
I'll run some
Hi,
Their paper is available online:
http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf
I thank Lukasz for letting me know.
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/comput
On Thu, Jun 07, 2007 at 09:20:35AM -0400, Don Dailey wrote:
> Someone could also run a weak Gnugo - perhaps with level set from 1-3 or
> something.
I have put up GnuGo on level 2 as "GnuGo-3.7.10-H2".
It looks like it is not eating much of my cpu power, so my home server
seems to be able to handle
On 6/7/07, Don Dailey <[EMAIL PROTECTED]> wrote:
I noticed there is almost no activity on the 19x19 server.
I can run an old version of housebot (0.4) on the server. It does 1-ply
search with heuristics, so its rating would be quite low, but it's almost
zero CPU load. It can run 24/7 minus
1800 is the default rating - probably too high. However the K-factor
is so high that a single win or loss will make a big difference and it
will eventually move to it's natural level.
- Don
On Thu, 2007-06-07 at 15:39 +0200, Heikki Levanto wrote:
> On Thu, Jun 07, 2007 at 09:20:35AM -0400, Don
So you basically play 1 game at a time - 1 per server.
I suggest that you will play many more games if you play them in bigger
batches, perhaps 3 or 4 games each. When you finish a 9x9 game, you
will likely have a long wait for a 19x19 games.
Could you get a bit more clever? When a 19x19 g
On 6/7/07, Don Dailey <[EMAIL PROTECTED]> wrote:
I noticed there is almost no activity on the 19x19 server.
BTW - A google search for CGOS gives http://cgos.boardspace.net/ as the top
hit. That page has a link to http://cgos.boardspace.net/9x9/index.html but
not to the 19x19 go server. I kn
I still have a bunch of work to do on getting this better organized. I
don't have simple instructions for running on the 19x19 server (they are
buried on [EMAIL PROTECTED] somewhere) and there is still no
nice way to download games sets.
It's a simple matter of finding the time!
But you a
Where are heuristics applied in UCT Go?
The following is a review of the literature regarding application of
heuristics to UCT Go. It explicitly does not address questions of how
the heuristics are generated nor of other algorithmic improvements.
Numbers are section numbers within papers.
I eag
On 6/7/07, Peter Drake <[EMAIL PROTECTED]> wrote:
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van denHerik
H.J., and Bouzy B. Progressive strategies for Monte-Carlo tree
search.
1.3.1: Add heuristic value (divided by # of playouts) to UCT value.
While I haven't done any form
By all means, try it out and write up a paper!
Peter Drake
http://www.lclark.edu/~drake/
On Jun 7, 2007, at 11:25 AM, Jason House wrote:
On 6/7/07, Peter Drake <[EMAIL PROTECTED]> wrote:
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van den
Herik H.J., and Bouzy B. Progress
Is anyone else here going to the International Conference on
Artificial Intelligence in Lost Wages, Nevada later this month?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.o
17 matches
Mail list logo
