Thanks again for more explanations. I think the AMAF is clear to me now.
When you say you count all the playouts starting from an empty board,
then
I have no idea how our outcome can be different by 3-4 moves,
which is
coincidentally the average depth of a uniform tree of 1,000,000 moves
on a 9x9 board.
Well we are doing 2 completely different things - so it is
surprising to
me that we actually came that close.
This I don't understand. Both do a playout starting from an empty
board, trying every move but ko-captures and eye-filling moves (using
the same definition of eye). These are not completely different
things. These should be EXACLTY the same things. The only thing
different is that in my program the first few moves are selected by
my UCT search instead of random selection as in your program. But I
believe that does not affect the average game length one bit.
When I just run playouts from an empty board I get the same average
length, confirming that UCT selection does not influence the game-
length. I didn't assume you were doing a UCT search. I didn't
understand what kind of search you did exactly but in any case failed
to see how it would change the average game-length.
This is still something I don't understand. Are there others who
implemented the same thing and got 111 moves per game on average? I
tried to look through some posts on this list but didn't see any
other numbers published.
Mark
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
