That really helps. Kind of like a lazy evaluating ST.
The problem remains O9n*n!), but for n-1 * n! passes the comp() comes down to
return $cache{$_[0]}{$_[1]} if exists $cache{$_[0]}{$_[1]};
Which is a huge time saver (provided I don't run out of memory:).
Thanks.
In reply to Re: Re: Detecting transpositions
by BrowserUk
in thread Detecting transpositions
by BrowserUk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |