✦ LIBER ✦

On the modular n-queen problem

✍ Scribed by Olof Heden

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 408 KB
Volume: 102
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90050-p

No coin nor oath required. For personal study only.

✦ Synopsis

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(24) = 22.

📜 SIMILAR VOLUMES

Discrete Mathematics: To: O. Heden, “On

Discrete Mathematics: To: O. Heden, “On the modular n-queen problem” 102 (1992) 155–161

✍ Paul Monsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 32 KB

The modular n-queen problem

✍ Torleiv Kløve 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 228 KB

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

The modular n-queens problem in higher d

The modular n-queens problem in higher dimensions

✍ Scott P. Nudelman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Maximal partial spreads and the modular

Maximal partial spreads and the modular n-queen problem

✍ Olof Heden 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

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

On the queen domination problem

✍ Charles M. Grinstead; Bruce Hahne; David Van Stone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A configuration of queens on an m X m chessboard is said to dominate the board if every square either contains a queen or is attacked by a queen. The configuration is said to be non-attacking if no queen attacks another queen. Let f(m) and g(m) equal the minimum number of queens and the minimum numb