Universality of infinite chess

DOI10.1112/PLMS.70233MaRDI QIDQ7402690zbMATH OpenFDO

Authors Matthew Bolan, Andreas Tsevas

Publication date 2026

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/PLMS.70233

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Cites work

• Classical recursion theory. The theory of functions and sets of natural numbers
• Complexity of winning strategies
• scientific article; zbMATH DE number 3078993 (Why is no real title available?)
• Infinite Hex is a draw
• The Mate-in-n Problem of Infinite Chess Is Decidable
• Transfinite game values in infinite chess
• Über eine Schlußweise aus dem Endlichen ins Unendliche.

This page was built for publication: Universality of infinite chess

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402690)