Content deleted Content added
m Replace or disable a template per TFD outcome; no change in content |
No edit summary |
||
Line 457:
|{{Unknown}}, but mate-in-n is decidable<ref name="Brumleve2012">{{cite journal | author = Stefan Reisch, Joel David Hamkins, and Phillipp Schlicht | title = The mate-in-n problem of infinite chess is decidable | journal = Conference on Computability in Europe | year = 2012 | pages = 78–88 | arxiv = 1201.5597 | url = https://arxiv.org/pdf/1201.5597.pdf}}</ref>
|-
|[[Magic:
|style="text-align:right;"|
|style="text-align:right;"|
Line 466:
|AH-hard<ref name="Biderman">{{cite arXiv | author = Stella Biderman | title = Magic: the Gathering is as Hard as Arithmetic | year = 2020 | class = cs.AI | eprint = 2003.05119 <!-- | url = https://arxiv.org/pdf/2003.05119.pdf -->}}</ref>
|-
|Wordle
|5
|12,972{{Refn|The amount of potential candidates for the answer at the start.}}
|
|6
|
|<ref>{{Cite journal |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]]{{Refn|Currently open whether if is NP or PSPACE-complete in certain cases, also unknown if it is in FPT when parametized.|group=Note}}
|}
| |||