UNO is hard, even for a single player (Q389942)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6248967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | UNO is hard, even for a single player |
scientific article; zbMATH DE number 6248967 |
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
0.7757642865180969
0 references
0.7576543688774109
0 references
0.7531900405883789
0 references
0.7526482343673706
0 references
0.7217531204223633
0 references
