Sorry if this is the wrong section i didn't exactly know where to put this problem(adsbygoogle = window.adsbygoogle || []).push({});

Now the n-queens problem has an arithmetic solution by Gauss:

Suppose n is even. For any k,

(1) If n is not 6k+2,

j = 2i+1, for 0 <= i < n/2

j = 2i mod n, for n/2 <= i < n

(2) If n is not 6k

j = (n/2 + 2i -1) mod n, for 0 <= i < n/2

j = (n/2 + 2i + 2) mod n, for n/2 <= i

For odd numbers, we can attach a queen at (n-1, n-1).

source: http://bridges.canterbury.ac.nz/features/eight.html

i don't fully understand it and where it came from

what is the proof?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Gauss solution of n-queens problem

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Gauss solution queens | Date |
---|---|

I Finding the explicit solution of a trig equation | Nov 21, 2017 |

I Simplifying integral of Gauss' hypergeometric function | Sep 6, 2016 |

I Don't understand lemma about primitive polynomial product | May 25, 2016 |

Gauss-Jordan Elimination | Dec 14, 2015 |

Gauss's Trick - Arithmetic Sums | Mar 28, 2014 |

**Physics Forums - The Fusion of Science and Community**