Pith. Sign in

RECORD

Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Colin McDonagh

Discrete Mathematics · Submitted 1 Feb 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Epiphainein counts unreachable single-side pawn diagrams (in chess) where pawns can move forward or diagonally-forward without limit whilst remaining on the board.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2202.00428 (version 1)
Pith IDO6IPPSMV, Pith's permanent record of this paper and its review
CitationColin McDonagh. "Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures." arXiv:2202.00428 (2022). https://pith.science/paper/O6IPPSMV
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,935 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.78 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.36 · compares with prior results 0.06 · mentions code or data availability 0.08.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Epiphainein counts unreachable single-side pawn diagrams (in chess) where pawns can move forward or diagonally-forward without limit whilst remaining on the board. contribution 0.92 0.70 0.34 asserted 1.00
s1 Epiphainein is a serial calculation and takes a few seconds to calculate the number of unreachable diagrams on a regular 8 x 8 board. method 0.72 0.81 0.10 asserted 0.96
s2 With a decent machine it should take roughly 4 hours to calculate the same on a 10 x 10 board. result 0.49 0.51 0.08 hedged possibility 0.87

What kind of paper the classifier reports this is: method or tool 0.96 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.