@InProceedings{demaine_et_al:LIPIcs.ITCS.2020.62,
  author =	{Demaine, Erik D. and Hendrickson, Dylan H. and Lynch, Jayson},
  title =	{{Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard}},
  booktitle =	{11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  pages =	{62:1--62:42},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-134-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{151},
  editor =	{Vidick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.62},
  URN =		{urn:nbn:de:0030-drops-117478},
  doi =		{10.4230/LIPIcs.ITCS.2020.62},
  annote =	{Keywords: motion planning, computational complexity, NP, PSPACE, EXP, NEXP, undecidability, games}
}