Colin McDonagh·2020-07-28·via math.CO updates on arXiv.org
This paper is concerned with unreachable pawn diagrams and the subset of which can be generated using Hall's Marriage Theorem. The result is 1 in 23 diagrams are unreachable by applying the theorem.