arXiv (All)
open access
How long is a game of Uno? A counting law for large hands and the Wild Draw Four hoard
We study the length of one round of Uno under the official rules, for N players who each start with M cards. The fastest possible round takes at least M turns with two players and at least 2M-1 turns with three or more, and both bounds are attained for small M. An exact search over random deals show
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The spectral Erdős book theorem: sharp bounds and stability#1227464
- Optimal High Probability Bounds for Random Order Online Sorting#1326688
- Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times#999696
- Negociaciones y teoría de los juegos#764910
- Card-Based Computation in the Virtual Player Simulation Model#632764
Record · ID 1324677
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive