Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures

02/01/2022
by   Colin McDonagh, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2021

An upper bound for the number of chess diagrams without promotion

The number of legal chess diagrams without promotion is bounded from abo...
research
12/03/2010

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

The Border algorithm and the iPred algorithm find the Hasse diagrams of ...
research
03/28/2022

Chess is hard even for a single player

We introduce a generalization of "Solo Chess", a single-player variant o...
research
09/12/2022

Computer algebra calculations in supersymmetric electrodynamics

We propose a new symbolic algorithm and a C++ program for generating and...
research
05/01/2018

State Diagrams of a Class of Singular LFSR and Their Applications to the Construction of de Bruijn Cycles

The state diagrams of a class of singular linear feedback shift register...
research
07/11/2019

ADDMC: Exact Weighted Model Counting with Algebraic Decision Diagrams

We compute exact literal-weighted model counts of CNF formulas. Our algo...
research
12/15/2020

A new perspective of paramodulation complexity by solving massive 8 puzzles

A sliding puzzle is a combination puzzle where a player slide pieces alo...

Please sign up or login with your details

Forgot password? Click here to reset