gizmobench

Anagram Word Game

Find words in a seeded rack of six to nine letters. Use each tile once per word, shuffle the rack without changing its letters, and collect unique accepted words. Play with your own timer and minimum length, review the complete answer set, or send someone the same fixed 60-second challenge.

Pinned public-domain ENABLE · 172,823 words · each tile can be used once per word

Set up a round

Only the existing same-origin dictionary file is loaded, after you start or resume. Its byte count, SHA-256, word count and sorted lowercase entries are checked before a playable rack is published.

Accepted wordsNot started

A deterministic rack is built from a verified dictionary word, so it always has at least one honest answer. Unentered answers stay out of the active page until you request review.

Choose a rack and explicitly start a round to load the pinned local dictionary.

Accepted words
0
Remaining words
Not started
Minimum length
Not started
Round
Not started

Touched settings, accepted words and local history are saved only in this browser. Storage failures are reported; rounds are not silently removed. Unentered answers are regenerated from the pinned dictionary when you resume.

  • A A C TLetter-multiset rule example.
    ACT and CAT fit. TACT needs two T tiles and is rejected.
  • The same word twiceCase does not create a new word.
    One accepted word, one point.
  • Reveal before time expiresComplete dictionary answer review.
    The round becomes assisted practice and cannot share a score.

Accuracy. Words are checked against the pinned public-domain ENABLE corpus of 172,823 English words, including uncommon and inflected forms. This is not a NASPA or proprietary official-game dictionary. A letter tile can be used only once per word; duplicate accepted words add no points. Timed rounds continue while the page is hidden.

Common questions

Which dictionary checks the words?
The game uses the existing public-domain ENABLE 1.0 file with 172823 words, 1743363 bytes and SHA-256 3f16130220645692ed49c7134e24a18504c2ca55b3c012f7290e3e77c63b1a89. Its byte length, hash, count and sorted lowercase entries are verified before a round starts. ENABLE includes uncommon and inflected forms and is not a proprietary official-game list.
How are the letter racks created?
The version 1 algorithm selects a dictionary word of the chosen length using the seed, then shuffles its letters. It enumerates every dictionary word that fits the rack's letter counts and minimum length. This gives each rack at least one honest answer. The same seed, settings and pinned dictionary reproduce the same rack and complete answer set.
Can I reuse a letter tile within one word?
Each tile may be used once per word. For example, A A C T can form ACT or CAT, but TACT needs a second T tile. The same rack can be reused for different submitted words. Input is case-insensitive, and a repeated accepted word never adds another point.
Does shuffling change the score or answers?
No. Shuffle letters changes only the visible order of the existing tiles. The multiset of letters, complete answer set, score and elapsed time stay the same. A different seed may still produce the same rack letters; previously opened equivalent racks remain practice.
How do timed and untimed rounds end?
Local timers accept 0 to 86400 whole seconds, with 0 meaning untimed. Timed rounds use monotonic elapsed time and continue while the page is hidden. A round ends when time expires, all available words are found, or you choose End round now. Ending early can complete local play but cannot share a canonical challenge score.
What are the fixed challenge rules?
A canonical challenge has nine letters, 60 seconds, a three-letter minimum and the pinned ENABLE dictionary. Its score is the unique accepted word count; higher is better. Finish at the time limit or find every answer, with at least one valid word and no early reveal, to share a fresh score. The recipient starts the same rack explicitly, compares exact counts and can reshare their own result.
Can I reveal or review every answer?
Yes. Reveal answers and end round opens the complete alphabetized answer set and makes an unfinished round assisted practice. After a fresh round has already ended, Review all answers keeps its already earned result. The complete review is paginated, and copied or downloaded review text contains every answer rather than only the current page.
What is kept in local history?
Touched settings, entered words and completed-round records are stored only in this browser. Unentered answers are regenerated from the pinned dictionary. Resuming or reviewing a saved round verifies its exact rack and accepted words again; restored and replayed rounds cannot earn independent challenge scores. A storage failure is reported instead of silently deleting older records.
What happens if dictionary loading fails?
No unverified rack is published. The page keeps your settings and previous complete round, shows the specific load or verification error, and offers a retry. The fixed same-origin dictionary is loaded only after an explicit start or resume; rack construction runs in a cancellable worker.

Words are checked against the pinned public-domain ENABLE corpus of 172,823 English words, including uncommon and inflected forms. This is not a NASPA or proprietary official-game dictionary. A letter tile can be used only once per word; duplicate accepted words add no points. Timed rounds continue while the page is hidden.