[Magictour] Re: Bounds

In einer eMail vom 22/06/03 1:49:57 PM (MEZ) - Mitteleurop. Sommerze schreibt
Sterten@aol.com:


> with the bounds, IMO the best approach is:
>
> walk through all possible lines which can arise
> in a knight's square,
>


.= .in a semi-magic knight's tour


   where only this line is required
>
> to sum to 260. (there are less than 1e9)


oops there are a lot more than 1e9, maybe 1e12 and the whole calculation will
take some days. I just started it..

>
> 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.
>
>

this is a lot more than what fits into L1-cache, but most of these values
will never be accessed
and caching might work pretty well, since the same addresses will probably be
used in
consecutive accesses.


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