[Magictour] Re: Bounds

with the bounds, IMO the best approach is:

walk through all possible lines which can arise
in a knight's square, where only this line is required
to sum to 260. (there are less than 1e9)

this way you will find all partially filled lines, which are allowed.
Only the positions of the numbers, their sum and the position
and value of the last number are relevant.

This gives a list of 64*260*2^8*8 =34 million bits indicating whether
the position is allowed or not.

Whenever you are to enter square number x iwith move number mov in a
row(column)
with actual sum s and filled pattern p you check whether
array (mov,s,p,x) is 1 or zero .

Too bad that Hugues already finished so many tours, I'd like to get the
node-counts
for this new bit-array-constraints rather than your used bounds !


Guenter


Magictour mailing list
To unsubscribe: mailto:magictour-request@ml.free.fr?subject=unsubscribe
To mail to the mailing list: mailto:magictour@ml.free.fr


Received on Thu Dec 04 14:24:18 2001