Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures
Discrete Mathematics
2022-02-02 v1
Abstract
Epiphainein counts unreachable single-side pawn diagrams (in chess) where pawns can move forward or diagonally-forward without limit whilst remaining on the board. Epiphainein is a serial calculation and takes a few seconds to calculate the number of unreachable diagrams on a regular 8 x 8 board. With a decent machine it should take roughly 4 hours to calculate the same on a 10 x 10 board.
Cite
@article{arxiv.2202.00428,
title = {Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures},
author = {Colin McDonagh},
journal= {arXiv preprint arXiv:2202.00428},
year = {2022}
}
Comments
9 pages, 7 figures, 1 table