Re: Superko detection (was Re: [computer-go] M.Boon-Library)

[Peter Drake <drake@xxxxxxxxxx>]

A question:  do you have to walk through them, or can you just do a 
single hash table lookup to see if the current position is in the table?

How do you do invariance?  Some canonical form?

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


On Friday, October 22, 2004, at 10:23  AM, Frank de Groot wrote:

> > Keep talking.  Don't you always have to run the superko check?
> I check it by maintaining a list of rot/mir/colrev invariant board 
> hashes and walking over it for every move.
>
> Of course this can be greatly sped up by hashing the hashes into an 
> array with slots for the number of stones on the board etc. So you 
> don't compare say 250 board hashes worst-case or 100 typical, but only 
> 2 or 3 worst-case.
>
> I am making this up as I go so don't flame me when there's a thinking 
> mistake here.
>
>
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/