Revision as of 20:19, 12 February 2022 edit 2a00:23c8:218d:fa01:1d9a:1ade:e33d:6 (talk) See Talk page: estimates for gametree complexity etc for MtG are removed, since only its computational complexity is assessed in the referenced literature ← Previous edit		Revision as of 02:05, 29 April 2022 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits rm bogus url (even before archiving was incorrect) Next edit →
Line 207: \|{{ts\|ar}}\| \|{{ts\|ar}}\|180 \|{{ts\|ar}}\|<ref name=Bell_Halma>{{cite journal\|author=G.I. Bell\|title=The Shortest Game of Chinese Checkers and Related Problems\|journal=Integers\|year=2009\|volume=9\|doi=10.1515/INTEG.2009.003\|arxiv=0803.1245~~\|url=http://emis.ams.org~~\|bibcode=2008arXiv0803.1245B\|s2cid=17141575\|access-date=2021-06-26~~\|archive-date=2019-09-02\|archive-url=https://web.archive.org/web/20190902211912/http://www.emis.ams.org/\|url-status=dead~~}}</ref> \|[[EXPTIME]]-complete <ref name=pebble>{{cite journal\|title=Classes of Pebble Games and Complete Problems\|journal= SIAM Journal on Computing\| volume = 8\| year = 1979 \|pages= 574–586\|author1=Takumi Kasai \|author2=Akeo Adachi \|author3=Shigeki Iwata \|doi=10.1137/0208046\|issue=4}} Proves completeness of the generalization to arbitrary graphs.</ref> \|-

Game complexity: Difference between revisions