𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The modular n-queen problem

✍ Scribed by Torleiv Kløve

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
228 KB
Volume
19
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Received 19 Ianu~y 19%

WC show that the modular n-queen prohlcm has a solutton if and only if gcd(n, 6,) = I. We give a class of solutions for all thcsc n.

📜 SIMILAR VOLUMES

On the modular n-queen problem
On the modular n-queen problem
✍ Olof Heden 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Heden, O., On the modular n-queen problem, Discrete Mathematics 102 (1992) 155-161. Let M(n) denote the maximum number of queens on a modular chessboard such that no two attack each other. We prove that if 4 or 6 divides n then M(n) c n -2 and if gcd(n, 24) = 8 then M(n) 2 n -2. We also show that M

Maximal partial spreads and the modular
Maximal partial spreads and the modular n-queen problem II
✍ Olof Heden 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 624 KB

We prove that if q + 1 E 8 or 16 (mod 24) then, for any integer n in the interval (q2 + 1)/2 + 3 < n < (Sq' + 4q + 7)/8, there is a maximal partial spread of size n in PG(3, q).