Rook endgame problems in \(m\) by \(n\) chess

DOI10.1016/J.AAM.2014.09.002zbMath1378.91039arXiv1403.4966OpenAlexW2070983721MaRDI QIDQ2406539

Thotsaporn ``Aek Thanatipanonda

Publication date: 5 October 2017

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.4966

zbMATH Keywords

recurrencechess endgamefinite state method

Mathematics Subject Classification ID

Combinatorial games (91A46)

Uses Software

• ToadsAndFrogs

Cites Work

• Unnamed Item
• How to beat Capablanca
• A symbolic finite-state approach for automated proving of theorems in combinatorial game theory

This page was built for publication: Rook endgame problems in \(m\) by \(n\) chess