Have you considered precomputing transpositions?
Then, comp(A, B) becomes
If everything is in a big hash (i.e., if you've traded space for time), the lookup is quick. You could even do a lazy initialization of the transposition set.
In reply to Re: Detecting transpositions
by dws
in thread Detecting transpositions
by BrowserUk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |