Le vendredi 1 décembre 2006 06:24, Don Dailey a écrit : > > On Thu, 2006-11-30 at 18:40 -0800, David Fotland wrote: > > How does monte carlo go do with fights that are trivial to evaluate, but > > hard to search? > > It's easy to construct problems that any program cannot handle including > yours. >
http://trac.gnugo.org/gnugo/ticket/10 This is a terrible real game, and the end become rather complicate (due to GNU Go kindness, of not killing something earlier ;) 9 groups involved in a semeai, but w resist with local seki, so a good order is needed for a kill cascade. Move 354 is probably the last losing move for B (i dont rememebr precisely) w can win even if he loses part of his stones, only one sequence of kill gives victory for B. (the easiest one started on top left, but gg wasted it) As order of moves is important, i guess MC programs would have hard time with this. result : B all dead with 9 handi on 19x19 board ! Alain _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
