Don Dailey wrote:
I'm not sure I understand - when you say N playouts, do you mean N
visits of that node? Because once you visit a node, you expand it, no
longer doing playouts from that point.
Yes, I mean N visits. In my view, every playout starts at the root.
For instance if e5 is played (from the root position) are you saying we
would only look at the moves touching e5 the first few times e5 was
visited, then start looking at distance 2 for a while, and so on
stopping after 3?
Yes, except that you would not stop after 3. Continue at distance 4,
then 5, etc. This guarantees that in the limit of infinite thinking
time, this algorithm would be optimal.
The reference bot of course does not build a tree, what I'm actually
looking for is a way to produce a medium strength but really simple bot
that does not build a tree and just has a lot of playout magic.
I wonder if this behavior can be emulated in the playouts somehow? It's
not so simple because we are not expanding a tree, and when we look at
some moves more often than others we get more statistical noise in the
moves we don't look at, and this can make them look artificially good or
bad. I can definitely see how such a scheme would work well in the
tree.
- Don
Oh, sorry, I thought your program was an UCT bot. If you build no tree,
then progressive widening probably does not help much. I am not sure.
Rémi
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
