Re: [computer-go] Spiral pattern matching and data structures

[Paul Pogonyshev <pogonyshev@xxxxxxx>]

I wrote:
> Arend Bayer wrote:
> > > >  - instead of storing the direction at each point, we store the
> > > > offset to the starting position
> > > >  - which is particularly effective since I changed this to a board
> > > >      representation by a one-dimensional array (as usual)
> > > > (i.e., there are no pointers involved).
> > >
> > > Out of curiosity, an array of what?  Are there point objects (or
> > > structs, or whatever) or is it something simpler?
> >
> > Just ints with value 0 (empty), 1 (white), 2 (black) or 3 (off-board).
> > What else would you need?
>
> An array of chars, actually.

As Arend pointed out in a private message, it's an really array of ints.
Chars are used in "normal" board, i.e. the one used for everything but
DFA pattern matching.

Paul

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