>> This is taken onto account in the tree. >> If playing one move lead 10% of time to +10, and 90% to -20, >> the resulting value is -17 >> (of course with the bot evaluation/playout) > > Reducing the value to -17 is losing a lot of information. Another move > might have 20% chances of +10 and 80% chances of -24 giving -17, are > they really just as good? > ... > To put this another way, I think that it would be a step in the right > direction to be able to handle the uncertainities of the values in the > tree. Maybe some already do that?
When I read this it reminded me of experiments I tried before to pass more than one piece of information up from the leaf nodes of a (min-max) tree. E.g. a territory estimate and an influence estimate. I gave up as it got too complex to handle incomparable nodes (e.g. move A gets more territory, less influence). I remember having a really good reason to want to delay reducing multiple features to a single number , but it is all a bit fuzzy now. Does this type of search have a name, and any associated research? Darren -- Darren Cook, Software Researcher/Developer http://dcook.org/gobet/ (Shodan Go Bet - who will win?) http://dcook.org/mlsn/ (Multilingual open source semantic network) http://dcook.org/work/ (About me and my work) http://dcook.org/blogs.html (My blogs and articles) _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
