[computer-go] UCT-Questions

[Chrilly]

>
> Incompetent cut'n'pasting, there.  Fortunately Richard Brown has given the 
> URL I was aiming for.
>
> Nick

UCT calculates for each state at depth d the expected payoffs for all moves. 
Does one have a hashtable where one stores not only the positions but also 
the the expected values of the moves?
An Entry for 19x19 would be quite large. 362 moves, value, move count. Would 
make at least 362x4 Bytes plus Hashcode and depth?

Most of the moves in a given position would have been never played before 
(especially deeper in the tree). What is the expected value of a 
non-played-move?

Chrilly