On Tue, Apr 27, 2010 at 2:59 AM, Yamato <[email protected]> wrote: > Erik van der Werf wrote: >>I just checked to be sure; Steenvreter correctly passes in both >>examples. I'm speculating, but I think your problem is that you only >>adjust for the difference between Japanese and Chinese counting in the >>playouts. However, once consecutive passing gets into the tree you >>have to correct earlier. >> >>The way I think of it Japanese rules have two phases: (1) the game >>phase and (2) the confirmation phase. In the game phase passing first >>can gain a point. In the confirmation phase it can not. The >>confirmation phase normally starts after 2 consecutive passes. If the >>confirmation phase has not started yet in the tree then the entire >>playout can be considered a confirmation phase. > > Do you have a special algorithm for the confirmation phase in the tree?
Nothing special, I just mark the state where the confirmation phase starts (I call this the scoring state) and allow the tree to grow further after the two consecutive passes. > Could you explain the details? I compute the Chinese score using an ordinary playout and then compensate for the difference between Japanese and Chinese scoring taking into account properties of the scoring state such as the pass-difference, game length parity, and handicap. Erik _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
