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

[Chris Fant <chrisfant@xxxxxxxxx>]

> One approach is to put the "real" board in the center of a much larger
> array of off-board points, but this is unsatisfying because of the
> amount of memory involved.  Does anyone have a better approach?  What
> does gnugo do?

My program uses this kind of spiraling pattern.  I don't use an
super-sized board.  While matching the pattern, I check to see if a
point is an edge.  If so, I don't match any point points on that side
of the pattern because I know they are also edges (and they will map
incorrectly to my board representation).  So if the point two spaces
west of the center of the pattern is an edge, I can be sure that all
points two spaces or more west of the center are also the edge.
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/