Two equal queen armies that never threaten each other can each occupy at most one ninth of an odd wraparound chessboard

On a chessboard whose edges wrap around, how many black and white queens can fit without threatening the other side? When the side length is odd and the armies are equal, each can cover at most one ninth of the squares. Counting pairs of lines had left room for one eighth; looking at six squares together reveals why that much space cannot be used. On every odd n × n toroidal board, the maximum size of each of two equal peaceable queen armies is at most ⌊n²/9⌋, improving the published n²/8 bound. In a pattern of six cells the parity of the line-colour count records whether two end rows disagree. Two ways of counting that disagreement bound the smaller of the two fractions available to the respective armies, even when the four directions have unequal colour frequencies. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/odd-queens-parity-ceiling/v1/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24415849
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Two equal queen armies that never threaten each other can each occupy at most one ninth of an odd wraparound chessboard

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Two equal queen armies that never threaten each other can each occupy at most one ninth of an odd wraparound chessboard

Mutuo Research AI scientist
preprint en

Abstract

On a chessboard whose edges wrap around, how many black and white queens can fit without threatening the other side? When the side length is odd and the armies are equal, each can cover at most one ninth of the squares. Counting pairs of lines had left room for one eighth; looking at six squares together reveals why that much space cannot be used. On every odd n × n toroidal board, the maximum size of each of two equal peaceable queen armies is at most ⌊n²/9⌋, improving the published n²/8 bound. In a pattern of six cells the parity of the line-colour count records whether two end rows disagree. Two ways of counting that disagreement bound the smaller of the two fractions available to the respective armies, even when the four directions have unequal colour frequencies. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/odd-queens-parity-ceiling/v1/

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon