On Wed, Jan 30, 2008 at 04:35:18PM -0500, Don Dailey wrote: > Heikki Levanto wrote: > > > On Wed, Jan 30, 2008 at 03:23:35PM -0500, Don Dailey wrote: > > > >> Having said that, I am interested in this. Is there something that > >> totally prevents the program from EVER seeing the best move? > >> > > > > Someone, I think it was Gunnar, pointed out that something like this: > > > > 5 | # # # # # # > > 4 | + + + + + # > > 3 | O O O O + # > > 2 | # # + O + # > > 1 | # + # O + # > > ------------- > > a b c d e f > > > > Here black (#) must play at b1 to kill white (O). If white gets to move > > first, he can live with c2, and later making two eyes by capturing at b1. > > > > You are totally incorrect about this. First of all, saying that "no > amount of UCT-tree bashing will discover this move" invalidates all the > research and subsequent proofs done by researchers. You may want > publish your own findings on this and see how well it flies. > > You probably don't understand how UCT works. UCT balances exploration > with exploitation. The UCT tree WILL explore B1, but will explore it > with low frequency. That is unless the tree actually throws out 1 > point eye moves (in which case it is not properly scalable and broken in > some sense.)
It was my understanding that most UCT programs would not consider b1, since they use the same move-generation for the MC playouts as for the UCT tree, and that forbids filling your own eyes. "Broken in some sense", as you say, although probably playing a bit stronger for it. If the move is considered at all, I have no problems believing that UCT will eventually find it. That much I understand of UCT. Sorry if I confused practical implementations and the abstract. As to publishing my findings, I need to make some real ones first, and then be sure of them. I have some ideas I am pursuing, but things go slowly when I only have some of my spare time for this project. When I do, it may be on a web page, or maybe just on this list - I am not in the game to publish academic papers. More to learn things myself, and if possible to add my small contribution to a field I find interesting. - Heikki -- Heikki Levanto "In Murphy We Turst" heikki (at) lsd (dot) dk _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
