Revision as of 02:05, 29 April 2022 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,670 edits rm bogus url (even before archiving was incorrect) ← Previous edit		Revision as of 03:00, 28 May 2022 edit undo Citation bot (talk \| contribs) Bots 5,867,424 edits Removed access-date with no URL. \| Use this bot. Report bugs. \| Suggested by Mako001 \| Linked from User:Mako001/access-date \| #UCB_webform_linked 5/118 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\|bibcode=2008arXiv0803.1245B\|s2cid=17141575~~\|access-date=2021-06-26~~}}</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