UNO is hard, even for a single player (Q389942): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2013.11.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.11.023 / rank | |||
Normal rank | |||
Revision as of 00:49, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | UNO is hard, even for a single player |
scientific article |
Statements
UNO is hard, even for a single player (English)
0 references
22 January 2014
0 references
algorithmic combinatorial game theory
0 references
dynamic programming
0 references
Hamiltonian path
0 references
mathematical puzzles/games
0 references
