2000 character limit reached
Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures
Published 1 Feb 2022 in cs.DM | (2202.00428v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.