[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: question

To: computer-go@xxxxxxxxxxxxxxxxx
Subject: Re: computer-go: question
From: Tristan Cazenave <cazenave@xxxxxxxxxxxxxxxxx>
Date: Tue, 14 Dec 1999 16:51:37 +0100
References: <57E4F9D1FB28D311B6FB009027700F653CE951@xxxxxxxxxxxxxxxxx> <3.0.5.32.19991214205835.015b70d0@xxxxxxxxxxxxxxxxx>
Reply-to: computer-go@xxxxxxxxxxxxxxxxx
Sender: owner-computer-go@xxxxxxxxxxxxxxxxx

> 4) Find every empty point's connectivity to nearby white and
> black stones.  This means the degree to which a hypothetical
> stone of each color can be connected to nearby living friendly
> stones.  Points which are strongly connected to one color and
> not connected to the other color are territory.  Go4++ uses
> something like this.

Golois uses this one also, but with less success :(

I think Go4++ also has knowledge on enclosing large territories.

So it probably uses probabilities about boundaries.

--
Tristan Cazenave
Universite Paris 8, Departement Informatique, Labo IA
2, rue de la Liberte 93526 Saint-Denis Cedex - France
http://www.ai.univ-paris8.fr/~cazenave/

References:
- RE: computer-go: question
  - From: Xu, Mousheng (SEA)
- RE: computer-go: question
  - From: David Fotland

Prev by Date: Re: computer-go: question -- Oracle of Life and Death FPGA
Next by Date: Re: computer-go: question
Previous by thread: RE: computer-go: question
Next by thread: Re: computer-go: question
Index(es):
- Date
- Thread