On 5/26/07, John Randall <[EMAIL PROTECTED]> wrote:
Here is my plan.
For each piece, find all possible placements on the board. Represent
these as bit vectors with 50 elements, each stored in a single 64-bit
integer. A combination of placements is illegal if the bitwise and of
the corresponding integers is nonzero. Do depth-first search on legal
lists of configurations for each piece.
That would not work as stated, for me, because I have a 32 bit machine,
and b. does not currently include such integer valued ieee floats in its
domain (I guess the issue has something to do with properly denormalizing
and renormalizing those floats):
12345 (17 b.) 2^49
|domain error
However, a pair of integers (8 bytes) would be more compact than my
current representation (10 bytes), and almost certainly faster to work
with. I'll give this a try, maybe this evening or tomorrow.
Thanks,
--
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
