Re: [computer-go] Bouzy/Zobrist algorithms

[Bruno Bouzy <Bruno.Bouzy@xxxxxxxxxxxxxxxxxxxxxxxx>]

Erik van der Werf a écrit :
> Peter Drake wrote:
>
> > Since the erosion happens after the dilation, does that mean that the 
> > values for the occupied points are never altered by either operation?
>
> Interesting question. I think that, at least for the (5,21) version, 
> some extremely weak stones may be removed by the erosions. (The values 
> for occupied points can of course change because otherwise there would 
> be no point in using large values.) I'm not sure if this was Bouzy's 
> intention, but it might actually help to improve performance. Maybe 
> Bruno can shed some light on this?
>
> Erik
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
You go further than me. The "occupied points" (points occupied by a 
stone) were not the aim of the algorithm. The initial value (say -+64) 
is supposed to be high enough to keep these points with their initial 
sign. Of course, with a sufficiently high number of erosions, you can 
find examples in which an occupied point decreases down to zero.

Bruno



--
---------------------------------------------------------------------
	Bruno Bouzy
	C.R.I.P.5 - UFR de mathematiques et d'informatique
	Universite Rene Descartes (Paris V)
	45, rue des Saints-Peres 75270 Paris Cedex 06 FRANCE
	tel: (33) (0)1 44 55 35 58 fax: (33) (0)1 44 55 35 35
	e-mail: bouzy@xxxxxxxxxxxxxxxxx
	http://www.math-info.univ-paris5.fr/~bouzy/
---------------------------------------------------------------------


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/