Fast data structures explained! (was Re: [computer-go] Go datastructures)

[Andrés Domínguez]

2007/7/20, Ian Osgood <iano at quirkster.com>:
> > Looking at only the four neighbors to detect eye-like points seems like it
> could leave many false eyes and allow captures of dangling chains.  Is there
> any mechanism to avoid this problem in the play of the bot?
> >
> >
> > It does also look at the diagonals; see Board.isEyelike(). I'll note this
> in the next version of the document.
>
>
> I lost a game in the most recent tournament from a buggy alternative to
> isEyelike.  I believe that it may be a bug that affects many, but I'm not
> really sure...  That makes me especially interested in seeing how others do
> it and the trades they accepted for it.
>
>
> My program disallows playing in eyes (string of empty surrounded by self)
> unless a neighboring stone is in atari. That catches your special-case, but
> is not good for saving tails (strings connected by false eyes, often found
> along the edge of the board).

Do you mean oiotoshi?

Andrés