Re: [computer-go] An [open] question on game tree search theory

[Don Dailey <drd@xxxxxxx>]

Actually, this is not true.  There has been some research that shows
even randomly generated leaf values produce play significantly
stronger than just playing random moves.  This may not be as much the
case in GO, because the experiments were done on other games.  The
reason seems to be based on the idea of pushing the game towards
positions where the computer has more options (which is good in most
games) and thus has a better opportunities to "find" the random nodes
with high scores.

- Don


> If E is just a random number attached to every node in the tree, search 
> is meaningless---any min-max value over the tree is just a min-max value 
> of random numbers, and hence worthless.
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/