When we deal with patterns and their rotations/reflections, we have a
"canonical" version that contains everything we care about, and all of
the R/R patterns have pointers to the canonical. If these are being
generated by some automated algorithm, we generate all of the R/R
as soon as we see the new pattern.
We do not consider this too difficult.
Cheers,
David
On 20, Jul 2007, at 6:16 PM, [EMAIL PROTECTED] wrote:
but
When I rotate/flip the board, those relations are now in a different
orientation and the same functions won't necessarily recognize them.
So this would have to be done from the beginning... Whenever a new
relation is generated to join two existing subpatterns, the 8 forms of
each of those would need to already be included in the existing set of
patterns.
Would this add as much hassle to the program as I expect, or does
it turn
out somehow simpler?
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
