3 problems

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

Uniqueness conjecture. The bishop–king proportionality

Let $n$ be the size of a square chessboard, and consider the trapping number for an enemy queen, namely the minimum number of white queens needed to trap the enemy queen. Universal…