Repetition in Permutation Wordle
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908755634946048 |
|---|---|
| author | Hiveley, Aurora |
| author_facet | Hiveley, Aurora |
| contents | In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called cyclic shift, which they conjecture performs optimally. We continue our investigation of this conjecture by considering how information is obtained and, at times, repeated during a game of permutation wordle using an arbitrary strategy. This analysis includes several algorithms to construct a secret permutation which prompts inefficient repetition according to the player's strategy, as well as proofs of their efficacy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_05971 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Repetition in Permutation Wordle Hiveley, Aurora Combinatorics In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called cyclic shift, which they conjecture performs optimally. We continue our investigation of this conjecture by considering how information is obtained and, at times, repeated during a game of permutation wordle using an arbitrary strategy. This analysis includes several algorithms to construct a secret permutation which prompts inefficient repetition according to the player's strategy, as well as proofs of their efficacy. |
| title | Repetition in Permutation Wordle |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.05971 |