[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: computer-go: A problem with understanding lookahead
> Sorry, but I think Vincent's right. Assuming that the random scoring function has a normal distribution about some mean, then the best chance of getting a good score at an odd ply is when there are many moves available. Conversely, the best chance of the opponent _not_ getting a good score (for the opponent) at an even ply is if the opponent has few moves to choose from. So a random searches tends to return moves that result in many choices for the program and few for the opponent.
And if the distribution is different? Uniform, for example?
/Vlad