Welcome to Super-Shiritori!
Please remember:
- No vandalism – Do not add nonsense, false info, spam, or blank pages.
- Respect others – Be polite and assume good faith.
- Use reliable information – Make sure edits are accurate and IMPORTANT.
- Stay constructive – Help us grow the wiki with content, especially with the Word compendium.
⚠️ Repeated vandalism or rule-breaking may result in warnings or blocks. If you see vandalism, please revert it and notify an admin.
Adding categories |
No edit summary |
||
| Line 1: | Line 1: | ||
== Anagram == | |||
Anagram is a private, single-player game in which the objective is to find as many valid words as possible using the letters of a randomly chosen base word, within a time limit. | |||
= | === Starting a Game === | ||
' | A game is created with <code>/anagram</code>, which takes no parameters. The bot selects a base word between 11 and 20 letters long, containing no hyphens or apostrophes; if the selected word doesn't have at least 5 possible answers, a different base word is chosen instead. The bot creates a private thread, posts the base word along with a difficulty label based on its length, and starts a 1-hour timer: "You have 1 hour to find as many words as possible." | ||
== | === Rules === | ||
A valid guess must: | |||
# Be at least 2 letters long | |||
# Contain no hyphens or apostrophes | |||
# Use only letters that appear in the base word, no more times than they appear there | |||
# Be a word in the dictionary | |||
* | The base word itself does not count as a guess and receives no reaction if submitted. Each other guess receives a reaction: | ||
* | * ✅ a new, valid word | ||
* 🟦 a word already found (duplicate; does not count again) | |||
* ❌ invalid (not a real word, not possible from the base word's letters, or contains punctuation) | |||
' | === Progress === | ||
The game's summary message updates after every correct word, refreshing as a new message every 21 words found (or immediately upon finding every possible word), so it does not scroll out of view in a busy thread. | |||
=== Ending a Game === | |||
The game ends automatically after 1 hour. At that point, the bot reports the number of words found out of the total possible, using "🎉 Congratulations!" if completion reached at least 80%, and "⏰ Time's Up!" otherwise. If any words were missed, a text file listing them (up to 5,000) is attached; 100% completion instead gets "You found every possible word! 🏆" | |||
== | === Statistics === | ||
Tracked per player: games played, total words found, total words missed, best single-game word count, best completion percentage, average completion percentage, and average words per game. The bot separately tracks whether a player has ever reached 100% completion or at least 51% completion in a game. These stats can be viewed with <code>/anagram_stats</code> and compared with <code>/anagram_leaderboard</code>. | |||
=== | === Scale === | ||
The number of distinct letter arrangements theoretically possible from a base word vastly exceeds both the bot's dictionary and what a player could realistically submit in an hour. This is illustrative only: it assumes every arrangement of a word's letters is itself a valid word, which is not true, and assumes a base word with no repeated letters, which maximizes the count. Treated this way, the number of distinct arrangements from 2 letters up to the full word length grows factorially with base word length, far outpacing both the bot's roughly one-million-word dictionary and the 3,600 words a player could submit at one word per second for the full hour (ignoring Discord's rate limits): | |||
= | {| class="wikitable" | ||
! Base word length !! Theoretical maximum arrangements !! Multiple of the real dictionary (~1,000,000 words) !! Reachable at 1 word/second for the full hour | |||
|- | |||
| 11 || 108,505,100 || 108.5× || 3.318 × 10⁻³% | |||
|- | |||
| 12 || 1,302,061,332 || 1,302.1× || 2.765 × 10⁻⁴% | |||
|- | |||
| 13 || 16,926,797,472 || 16,926.8× || 2.127 × 10⁻⁵% | |||
|- | |||
| 14 || 236,975,164,790 || 236,975.2× || 1.519 × 10⁻⁶% | |||
|- | |||
| 15 || 3,554,627,472,060 || 3,554,627.5× || 1.013 × 10⁻⁷% | |||
|- | |||
| 16 || 56,874,039,553,200 || 56,874,039.6× || 6.330 × 10⁻⁹% | |||
|- | |||
| 17 || 966,858,672,404,672 || 966,858,672.4× || 3.723 × 10⁻¹⁰% | |||
|- | |||
| 18 || 17,403,456,103,284,402 || 17,403,456,103.3× || 2.069 × 10⁻¹¹% | |||
|- | |||
| 19 || 330,665,665,962,403,980 || 330,665,665,962.4× || 1.089 × 10⁻¹²% | |||
|- | |||
| 20 || 6,613,313,319,248,079,980 || 6,613,313,319,248.1× || 5.444 × 10⁻¹⁴% | |||
|} | |||
The theoretical space roughly increases by a factor of about 12 to 20 with each additional letter in the base word, consistent with factorial growth. Even at the shortest possible base word length (11 letters), this theoretical figure already exceeds the bot's entire dictionary more than a hundredfold. | |||
[[Category:Information]] | [[Category:Information]] | ||
[[Category:Games(bot)]] | [[Category:Games(bot)]] | ||
Revision as of 22:08, 5 August 2026
Anagram
Anagram is a private, single-player game in which the objective is to find as many valid words as possible using the letters of a randomly chosen base word, within a time limit.
Starting a Game
A game is created with /anagram, which takes no parameters. The bot selects a base word between 11 and 20 letters long, containing no hyphens or apostrophes; if the selected word doesn't have at least 5 possible answers, a different base word is chosen instead. The bot creates a private thread, posts the base word along with a difficulty label based on its length, and starts a 1-hour timer: "You have 1 hour to find as many words as possible."
Rules
A valid guess must:
- Be at least 2 letters long
- Contain no hyphens or apostrophes
- Use only letters that appear in the base word, no more times than they appear there
- Be a word in the dictionary
The base word itself does not count as a guess and receives no reaction if submitted. Each other guess receives a reaction:
- ✅ a new, valid word
- 🟦 a word already found (duplicate; does not count again)
- ❌ invalid (not a real word, not possible from the base word's letters, or contains punctuation)
Progress
The game's summary message updates after every correct word, refreshing as a new message every 21 words found (or immediately upon finding every possible word), so it does not scroll out of view in a busy thread.
Ending a Game
The game ends automatically after 1 hour. At that point, the bot reports the number of words found out of the total possible, using "🎉 Congratulations!" if completion reached at least 80%, and "⏰ Time's Up!" otherwise. If any words were missed, a text file listing them (up to 5,000) is attached; 100% completion instead gets "You found every possible word! 🏆"
Statistics
Tracked per player: games played, total words found, total words missed, best single-game word count, best completion percentage, average completion percentage, and average words per game. The bot separately tracks whether a player has ever reached 100% completion or at least 51% completion in a game. These stats can be viewed with /anagram_stats and compared with /anagram_leaderboard.
Scale
The number of distinct letter arrangements theoretically possible from a base word vastly exceeds both the bot's dictionary and what a player could realistically submit in an hour. This is illustrative only: it assumes every arrangement of a word's letters is itself a valid word, which is not true, and assumes a base word with no repeated letters, which maximizes the count. Treated this way, the number of distinct arrangements from 2 letters up to the full word length grows factorially with base word length, far outpacing both the bot's roughly one-million-word dictionary and the 3,600 words a player could submit at one word per second for the full hour (ignoring Discord's rate limits):
| Base word length | Theoretical maximum arrangements | Multiple of the real dictionary (~1,000,000 words) | Reachable at 1 word/second for the full hour |
|---|---|---|---|
| 11 | 108,505,100 | 108.5× | 3.318 × 10⁻³% |
| 12 | 1,302,061,332 | 1,302.1× | 2.765 × 10⁻⁴% |
| 13 | 16,926,797,472 | 16,926.8× | 2.127 × 10⁻⁵% |
| 14 | 236,975,164,790 | 236,975.2× | 1.519 × 10⁻⁶% |
| 15 | 3,554,627,472,060 | 3,554,627.5× | 1.013 × 10⁻⁷% |
| 16 | 56,874,039,553,200 | 56,874,039.6× | 6.330 × 10⁻⁹% |
| 17 | 966,858,672,404,672 | 966,858,672.4× | 3.723 × 10⁻¹⁰% |
| 18 | 17,403,456,103,284,402 | 17,403,456,103.3× | 2.069 × 10⁻¹¹% |
| 19 | 330,665,665,962,403,980 | 330,665,665,962.4× | 1.089 × 10⁻¹²% |
| 20 | 6,613,313,319,248,079,980 | 6,613,313,319,248.1× | 5.444 × 10⁻¹⁴% |
The theoretical space roughly increases by a factor of about 12 to 20 with each additional letter in the base word, consistent with factorial growth. Even at the shortest possible base word length (11 letters), this theoretical figure already exceeds the bot's entire dictionary more than a hundredfold.