2. We want other communities to find out about UCT, and start using it many different domains. It is not just a Go-programming algorithm!
Yes. I think the idea has many potential fields of application. In the samewhat dated book R.Epstein: The of Gambling and Statistical Logic the simple algorithm "Play an arm as long as he is winning" is proposed. But does not help too much. E.g. J.Schaeffer invented the History-Heuristik. This was long before jump-prediction become an important topic in microprocessor design. The first jump-predictions where static rules. After some years the hardware-designers invented then their own history-heuristic for jumps. ideas: http://www.cs.ualberta.ca/~silver/research/presentations/files/sylvain-silver.pdf Thanks. Actually I think the best notation would be: description in plain text + mathematical notation + pseudocode + many diagrams. But in a conference paper we have just 8 pages to describe everything, so we must make some compromises. Yes, I fully agree. Why do you call this UCT if there is no tree? Isn't this just roll-out simulation, as used by Tesauro and Galperin in 1996? Its the selection rule for making the rollouts at the root. This is a variant of UCT. Exactly its the multiarmed-bandit selection rule. It differs e.g from the rule proposed by Epstein. Chrilly
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
