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

[Peter Drake <drake@xxxxxxxxxx>]

On Thursday, January 20, 2005, at 11:22  AM, Arend Bayer wrote:

> Yes, that is basically what we do, with the following differences:
>  - the spiral Tanguy used in GNU Go's implementation is diagnoally
Is there any particular reason for this choice?

>  - 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?

> We use this bigger board. Ours is 3*19 * 3*19, a bit bigger than we
> would need, but that's still small enough to fit into the L1 cache on
> most processors I would guess.
> The bottleneck of the DFA algorithm is the memory access to the actual
> DFA, anyway.
If copying the board is needed in any global search, is multiplying the 
size of the board structure by 9 a problem?

Thanks!

Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/

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