Game complexity: Difference between revisions

Revision as of 16:32, 24 October 2022

Revision as of 01:38, 12 November 2022

Line 419:

|style="text-align:right;"| <ref name="Schadd2010">{{cite thesis | author = F.C. Schadd | title = Monte-Carlo Search Techniques in the Modern Board Game Thurn and Taxis | year = 2009 | url =https://project.dke.maastrichtuniversity.nl/games/files/msc/Fschadd_thesis.pdf | publisher = Maastricht University| archive-url = https://web.archive.org/web/20210114164554/https://project.dke.maastrichtuniversity.nl/games/files/msc/Fschadd_thesis.pdf | archive-date = 2021-01-14 }}</ref>

|

|-

|[[Go (game)|Go (19x19)]]

Line 472 ⟶ 471:

|6

|

|<ref>{{Citecite journalarxiv |last=Lokshtanov |first=Daniel |last2=Subercaseaux |first2=Bernardo |date=2022-05-14 |title=Wordle is NP-hard |url=http://arxiv.org/abs/2203.16713 |journal=arXiv:2203.16713 [cs]}}</ref>

|[[NP-hardness|NP-hard]], unknown if [[PSPACE-complete]] with parametization.

|}