论文标题
用无限捕获计算无法达到的单侧典当图
Counting Unreachable Single-Side Pawn Diagrams with Limitless Captures
论文作者
论文摘要
epiphainein计数无法到达的单侧典当图（在国际象棋中），典当可以向前或对角线前进而无需限制，同时保留在板上。 epiphainein是一个串行计算，需要几秒钟才能计算常规8 x 8板上无法实现的图表。使用一台不错的机器，在10 x 10板上计算大约需要4个小时的时间。
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.
