Petr Baudis: <20150407105648.gp6...@machine.or.cz>: >On Tue, Apr 07, 2015 at 07:20:37PM +0900, Hideki Kato wrote: >>For prior values in the tree, almost(?) all strong programs use Remi's >>method these days. >>http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf >Do you mean all the strong programs do progressive widening?
No. I meant that strong programs use prior in various ways (just an initial value for a move, for example) but (almost) all use Remi's method to compute the prior. Hideki -- Hideki Kato <mailto:hideki_ka...@ybb.ne.jp> _______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
