It's one part of my attempt to write a reasonably efficient function to calculate f(a, b), the number of full-spectrum rook's walks on an a x b board. (The integer sequence A096121 handles the specific case of a = 2, but I wish to extend to the more general case.)
I'd be kinda surprised if there were already a CPAN module for this, though I suspect an understanding of PDL might help.
Hugo
In reply to Re^2: better algorithm: bitwise reordering
by hv
in thread better algorithm: bitwise reordering
by hv
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |