arXiv (All)
open access
Permutation Wordle
We introduce a guessing game, ``Permutation Wordle,'' in which a guesser attempts to recover a setter's hidden permutation of the set $\{1, \ldots, n\}$. In each round, the guesser submits a word over the alphabet $\{1, \ldots, n\}$, and, as in the game Wordle, learns which entries are corre
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
- Penney's game for permutations#176980
- Nonnesting permutations avoiding 123#973323
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Avoiding patterns with three distinct letters in Canon permutations#821487
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
Record · ID 822294
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