Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.20229

The Arithmetic of Chess Piece Strength on the n x n Board

Frank M. V. Feys
View original source ↗Read source document ↗Export metadata ↓

Abstract

On the n x n chessboard, the move totals of distinct pieces satisfy a small number of striking arithmetic identities. The total diagonal mobility of the bishop and the total 8-neighbor mobility of the king are exactly proportional, with constant n/12, valid for every n. Among nontrivial boards, the strengths of two distinct pieces drawn from a natural thirteen-piece alphabet coincide only for n in {6, 8, 12}. We define the strength of a piece P on the n x n board as the probability that a uniformly random ordered pair of distinct squares forms a legal P-move on the empty board, and prove four main results. (1) An asymptotic dichotomy classifies pieces into riders (Theta(1/n) strength) and leapers (Theta(1/n^2) strength), with explicit rational leading constants. (2) A stable-ordering theorem identifies the threshold n* = 24 beyond which the strength order becomes fixed, with a complete tabulation of every transition for 4 <= n <= 24. (3) A complete classification of strength coincidences shows they occur only at the three magic boards n in {6, 8, 12}, accompanied by the closed-form identity str(K) - str(N) = 12/(n^2(n+1)), the unique near-coincidence between bishop and knight at n = 10 (gap 0.0606%), and the bishop-king proportionality str(B)/str(K) = n/12. (4) A Strength Algebra Theorem expresses the strength of any compound army as a linear functional of a four-dimensional atomic vector, and confines strength coincidences between distinct single pieces to the three magic boards. As immediate consequences we obtain explicit strength-preserving single-piece substitution rules on each magic board, and a characterization of the 8 x 8 board as the unique nontrivial board on which the rook attains a strength matched by another piece in the alphabet (the archbishop).

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank M. V. Feys. 2026-05-15. The Arithmetic of Chess Piece Strength on the n x n Board. https://arxiv.org/abs/2605.20229

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗