Skip to content
Lizely

Anagram Game

Unscramble five deterministic dictionary-backed words with exact rack enforcement, complete keyboard play, repairable checking, and independently audited letter multisets.

Privacy: your files never leave your device. All processing happens locally in your browser.

How to use

  1. 1.Read the clue, then type or tap the six displayed rack letters in the order that forms the dictionary-backed answer.
  2. 2.Use every rack tile exactly once; letters outside the rack, excess copies, nonletters, and answers longer than six characters are rejected.
  3. 3.Press Enter or Submit answer; partial entries cost nothing, the first distinct full error can be repaired, and solving all five rounds scores exactly 1,000.

About Anagram Game

Anagram Game is a deterministic five-round word-unscramble challenge. Each round shows six letter tiles in a deliberately mixed order plus an ordinary-language clue. Rearrange every displayed tile exactly once to form the clue's answer, then submit the complete six-letter arrangement. This is a game with fixed rounds, progress, mistakes, and completion; it is distinct from the Word Scrambler utility, whose purpose is to generate permutations from arbitrary user text rather than ask for one evidence-backed answer.

The five answers are PLANET, GARDEN, STREAM, CANDLE, and BRIDGE. Their displayed racks are TALPEN, NEDRAG, MAREST, DANCEL, and GIDBER. Every answer and every scramble contains exactly six ASCII letters. Answers are distinct, scrambles are distinct, and no scramble is already in answer order. Each scramble has precisely the same per-letter frequency map as its answer. These rack orders, the round sequence, score, and error policy were authored for Lizely rather than copied from a published game or dictionary exercise.

The answer data is externally supported. Cambridge Dictionary is the primary source for each spelling and intended clue sense, and Dictionary.com independently cross-checks all five. PLANET uses the sense of a large round body moving around a star. GARDEN uses an area where plants are grown. STREAM uses a small narrow river. CANDLE uses a wax object with a wick that gives light. BRIDGE uses a structure carrying a route over an obstacle. Ten HTTPS dictionary pages are retained in the evidence record, two for each answer.

Play by typing in the answer field or tapping the six rack tiles. Input is normalized to uppercase, but the logic accepts either letter case. The state boundary permits ASCII letters only, limits input to the current six-letter answer length, and enforces the rack's available multiplicities on every change. A letter absent from the rack is rejected. A repeated letter beyond the rack count is rejected. Pasting digits, spaces, punctuation, or more than six characters is rejected. The browser input is controlled, so rejected data never becomes hidden game state.

Rack tiles visually become unavailable as their corresponding occurrences are consumed. The implementation counts occurrences rather than treating a letter as a unique symbol, so the policy remains correct if a future audited round contains duplicates. Backspace removes the final accepted letter and returns that tile to the rack. Mouse and touchscreen players can complete every round with the tile and button controls. No drag gesture, hover-only action, or system keyboard is required.

Physical-keyboard play is complete. With the answer field focused, ordinary typing, Backspace, and Enter use native form behavior. When focus is on a rack tile or control, a window keyboard handler accepts letters, Backspace or Delete, and Enter through the same pure state functions. Repeated keydown events are ignored outside the input, preventing a held key from exhausting a rack or causing repeated submissions. The shared double-Escape gesture opens the spreadsheet-style boss screen, and another double Escape returns to the same round.

Submission separates incomplete work from a wrong complete arrangement. Zero through five accepted letters are incomplete, so Submit answer or Enter records no mistake and asks the player to use all six rack letters. Because input already enforces length, character class, and per-letter availability, any six-letter submission is an exact multiset permutation of the current answer. If that permutation is not the answer, the first distinct wrong arrangement records one mistake but remains editable.

Rechecking the unchanged wrong arrangement does not record another mistake. The state fingerprints each wrong submission with both its round index and full arrangement. A second mistake therefore requires a different full arrangement, whether in the same round or a later one. The second distinct wrong answer deadlocks the game until Restart. This prevents an accidental Enter repeat or button double-click from consuming both attempts while retaining a strict two-error boundary across the five-round run.

A correct answer advances immediately to the next deterministic round, clears the input, preserves the current mistake record, and shows a concise success message. Solving BRIDGE in the fifth round completes the game and awards exactly 1,000 points. The score is not reduced by typing method, erases, or time. A clean perfect run has zero mistakes and exactly 1,000 points; a run repaired after its first wrong full arrangement can still demonstrate complete knowledge of all five answers and also finishes at the fixed completion score.

Completion and deadlock are terminal states. After either outcome, typing, rack-tile clicks, direct input replacement, Backspace, and submission cannot modify the frozen state. Restart creates a new exact initial state: PLANET round selected, TALPEN rack restored, empty input, zero solved rounds, zero mistakes, no wrong fingerprints, zero score, and no feedback. The best score is retained only in local browser storage through the shared GameShell.

The release test does not call product validation helpers to prove the rack fixtures. A separate oracle defines the five answer, scramble, and clue triples literally. Its own frequency-map routine counts each character, sorts the key-count pairs, and compares answer with scramble. It confirms five unique answers, five unique scrambles, six letters in every value, answer-versus-scramble inequality, uppercase letters only, and exact multiset equality in all rounds. It then compares the independently authored fixtures with the exported product table.

Ten golden cases cover the five dictionary-backed answer-and-clue pairs and the five exact-multiset scramble pairs. Product-state checks separately cover lowercase normalization, permitted partial input, out-of-rack rejection, excess-multiplicity rejection, nonletter and overlength rejection, Backspace, incomplete no-error submission, first wrong repair, unchanged-wrong deduplication, correct round advancement, all-five-round completion, exact 1,000 points, second-distinct-error deadlock, terminal freezing, and deterministic Restart.

Everything runs locally in the browser. No user text is sent to a server, no account is required, no random word API is called, no dictionary lookup occurs during play, and no new package dependency is added. The six-column rack, full-width answer field, wrapping controls, and concise clue panel fit a 390-pixel viewport without horizontal scrolling. Native buttons use large square targets, and availability is communicated through labels and disabled state rather than color alone.

This fixed vocabulary game is recreational. It is not an intelligence test, literacy diagnosis, educational placement exam, medical assessment, or employment screen. Repeated play becomes easier through memory, so elapsed time does not affect scoring. A practical solving method is to identify likely word endings, use the clue to choose among possible arrangements, and verify that every rack tile appears exactly once before pressing Enter.

Methodology & sources

Store five original rounds containing a six-letter answer, exact-multiset scramble, clue, Cambridge primary URL, and Dictionary.com cross-check URL. Normalize accepted input to uppercase; require ASCII letters only, maximum answer length, and per-letter counts no greater than the rack. Treat partial submissions as incomplete without error, advance on exact answer equality, fingerprint wrong full permutations by round and arrangement, ignore unchanged resubmissions, deadlock on the second distinct error, award exactly 1,000 after all five correct rounds, and freeze terminal states. Independently compare literal answer and scramble frequency maps without importing product validators.

Frequently asked questions

How is this different from the Word Scrambler utility?
This is a five-round clue game with fixed evidence-backed answers, progress, mistakes, and a final score. Word Scrambler generates permutations from arbitrary input instead of testing one answer.
Can I use a letter more times than it appears in the rack?
No. Input is checked against the current rack's exact frequency map, so absent letters and excess copies are rejected before submission.
Where do the accepted answer spellings and clue meanings come from?
Each answer has a Cambridge Dictionary primary page and a Dictionary.com independent cross-check. The scramble orders are original Lizely fixtures.
Does pressing Enter twice count as two mistakes?
No. An unchanged wrong full arrangement is fingerprinted and counted once. A second mistake requires a different complete arrangement.

Related tools

Mini Games guides

View all