Triple-coincidence non-occurrence under single-piece extension

From papers

Let P\mathcal{P} be the existing piece alphabet, let PP be a single additional piece whose move total TP(n)T_P(n) is a polynomial in nn of degree at most 33, and let P=P{P}\mathcal{P}'=\mathcal{P}\cup\{P\}. Strength is measured by the paper's uniformly random-arrow probability on the n×nn\times n board.

Triple-coincidence conjecture. For every integer n4n\geq4, no three distinct pieces in P\mathcal{P}' share the same strength on the n×nn\times n board.

This asks whether the absence of triple strength coincidences persists after adjoining one piece of the stated polynomial complexity; the claim is presented as a further question and no resolution is given.

Progress summary

Open

No public discussion or published progress was found.

No public discussion or published progress was found.

Current status (as of August 2026): The conjecture appears open, with no recorded public activity.

Sources & referencesView supporting material

Primary source

Frank M. V. Feys, “The Arithmetic of Chess Piece Strength on the n x n Board”, arXiv:2605.20229 (2026).

Solutions 1

Counterexample

Counterexamples at every original magic board. In each construction below, exactly one new piece is adjoined. Its fixed move set is the disjoint union of several fairy-leaper move sets; the constituent leapers are not separately added to the alphabet. The source explicitly permits such compound pieces.

Let La,bL_{a,b} denote the leaper with all sign changes and coordinate exchanges of displacement (a,b)(a,b). Counting starting squares for each displacement gives, whenever nbn\ge b,

TLa,b(n)={4n(nb),a=0,4(na)2,a=b>0,8(na)(nb),0<a<b.T_{L_{a,b}}(n)= \begin{cases} 4n(n-b),&a=0,\\ 4(n-a)^2,&a=b>0,\\ 8(n-a)(n-b),&0<a<b. \end{cases}

Different leaper families have disjoint displacement sets, so their totals add.

Board n=6n=6. Adjoin the single compound piece

P6=L1,1L1,2L1,3.P_6=L_{1,1}\cup L_{1,2}\cup L_{1,3}.

Its exact polynomial, valid for every n4n\ge4, is

TP6(n)=4(n1)2+8(n1)(n2)+8(n1)(n3)=4(n1)(5n11).T_{P_6}(n)=4(n-1)^2+8(n-1)(n-2)+8(n-1)(n-3) =4(n-1)(5n-11).

The source's existing Centaur and Archbishop satisfy

TP6(6)=TCentaur(6)=TArchbishop(6)=380.T_{P_6}(6)=T_{\mathrm{Centaur}}(6) =T_{\mathrm{Archbishop}}(6)=380.

Board n=8n=8. Independently adjoin the single compound piece

P8=L0,1L0,2L1,2L2,2.P_8=L_{0,1}\cup L_{0,2}\cup L_{1,2}\cup L_{2,2}.

Its exact polynomial is

TP8(n)=20n252n+32,T_{P_8}(n)=20n^2-52n+32,

and

TP8(8)=TRook(8)=TArchbishop(8)=896.T_{P_8}(8)=T_{\mathrm{Rook}}(8) =T_{\mathrm{Archbishop}}(8)=896.

Board n=12n=12. Independently adjoin

P12=L0,3L3,3L4,4.P_{12}=L_{0,3}\cup L_{3,3}\cup L_{4,4}.

Its exact polynomial, again valid on every prescribed board n4n\ge4, is

TP12(n)=4n(n3)+4(n3)2+4(n4)2=12n268n+100.T_{P_{12}}(n)=4n(n-3)+4(n-3)^2+4(n-4)^2 =12n^2-68n+100.

Using the source's Bishop convention,

TP12(12)=TKing(12)=TBishop(12)=1012.T_{P_{12}}(12)=T_{\mathrm{King}}(12) =T_{\mathrm{Bishop}}(12)=1012.

Each additional piece has one fixed finite move set, is distinct from every original piece, and has a degree-two move-count polynomial. Since all strengths use the same denominator n2(n21)n^2(n^2-1), equal move totals give equal strengths. Thus Conjecture 9.2 fails separately at all three original magic board sizes 6,8,126,8,12, always with exactly one added piece.

For completeness, the adjacent Conjecture 9.1 also fails under its stated extension rules: adjoin just the explicitly permitted Wazir W=L0,1W=L_{0,1}. Then

TW(n)=4n(n1),TRook(n)=2n2(n1)=n2TW(n),T_W(n)=4n(n-1),\qquad T_{\mathrm{Rook}}(n)=2n^2(n-1) =\frac n2 T_W(n),

giving a second nonconstant linear proportionality, distinct from the Bishop--King proportionality.

Source: Feys, The Arithmetic of Chess Piece Strength on the n×nn\times n Board, Conjectures 9.1 and 9.2.

0 endorsements
Shivam Patel ·