Paper by Erik D. Demaine

Reference:

Josh Brunner, Lily Chung, Michael Coulombe, Erik D. Demaine, Timothy Gomez, and Jayson Lynch, “Complexity of Solo Chess with Unlimited Moves”, in Abstracts from the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2022), Tokyo, Japan, September 9–11, 2022, pages 132–133.

BibTeX

@InProceedings{SoloChess_JCDCGGG2022,
  AUTHOR        = {Josh Brunner and Lily Chung and Michael Coulombe and Erik D. Demaine and Timothy Gomez and Jayson Lynch},
  TITLE         = {Complexity of Solo Chess with Unlimited Moves},
  BOOKTITLE     = {Abstracts from the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2022)},
  bookurl       = {https://www.rs.tus.ac.jp/jcdcggg/},
  ADDRESS       = {Tokyo, Japan},
  MONTH         = {September 9--11},
  YEAR          = 2022,
  PAGES         = {132--133},

  length        = {2 pages},
  unrefereed    = 1,
  paperkind     = {abstract},
  withstudent   = 1,
  comments      = {The full paper is available as <A HREF="https://arxiv.org/abs/2302.01405">arXiv:2302.01405</A>.},
  papers        = {SoloChess_JCDCGGG2022full},
}

Comments:

The full paper is available as arXiv:2302.01405.

Length:

The abstract is 2 pages.

Availability:

The abstract is available in PDF (504k).

See information on file formats.

[Google Scholar search]

Related papers:

SoloChess_JCDCGGG2022full (Complexity of Solo Chess with Unlimited Moves)