Yes—Word Chain Memory accepts capital letters and extra spaces, but it still requires the words in the exact order with the same word boundaries. Capitalization and spacing are normalized before your answer is checked, so “EMBER harbor” and “ember harbor” refer to the same two words.
This answer is specific to Word Chain Memory, a five-round ordered-recall game. Each round keeps every earlier word and adds one new original word, so you must type the complete chain rather than only the newest word. If you mean a different product described as an ordered word game, its own input rules take priority.
What the answer checker treats as equivalent
The validator trims leading and trailing whitespace, accepts repeated spaces, and compares ASCII letters without case sensitivity. Those rules make typing more flexible without making the puzzle less exact. A valid entry contains ASCII-letter tokens separated by whitespace; it does not need matching capitalization or perfectly even spacing.
For a two-word target of ember harbor, the distinction between harmless formatting and a wrong answer looks like this:
| Typed input | Result | Reason |
|---|---|---|
| ember harbor | Accepted | Two word tokens appear in the required order. |
| EMBER HARBOR | Accepted | Letter case is ignored during comparison. |
| ember harbor | Accepted | Repeated spaces normalize without changing the tokens. |
| ember harbor | Accepted | Leading and trailing whitespace are trimmed. |
| emberharbor | Wrong answer | One token cannot stand in for two separate words. |
| ember, harbor | Harmless no-op | Punctuation is not accepted in the answer. |
| ember2 harbor | Harmless no-op | Digits are not accepted in the answer. |
| Blank submission | Harmless no-op | An empty answer is rejected without completing the round. |
The invalid rows are rejected as harmless no-ops rather than completed answers. By contrast, emberharbor is made from valid letters but represents the wrong token sequence, so it is treated as a wrong recall. That is why extra spaces are forgiving while removing a word boundary is not.
Where order and boundaries still matter
Normalization affects capitalization and whitespace, not the position of a word. If the current target is ember harbor, entering HARBOR EMBER is wrong because the order changed. Entering emberharbor is also wrong because two words have been merged into one token. Changing capitalization cannot correct either mistake, but you can repair a glued entry by changing “emberharbor” to “ember harbor.”
The five-round fixture follows these cumulative files:
| Round | Complete chain to recall |
|---|---|
| 1 | ember |
| 2 | ember harbor |
| 3 | ember harbor velvet |
| 4 | ember harbor velvet cactus |
| 5 | ember harbor velvet cactus orbit |
Each answer must reproduce the entire row from beginning to end. For example, the round-four answer is ember harbor velvet cactus, not simply cactus. These ordinary words are fixed game pieces rather than a vocabulary standard, spelling-level assessment, or language-proficiency test.
Capitalization can follow whichever style you prefer. The sequence cannot. Word count, spelling, order, and the boundary between each pair of words all remain part of the comparison.
How to enter each round in Word Chain Memory
- Read the current chain from left to right. Stay in the Reveal state long enough to identify every individual word block and note where one word ends and the next begins.
- Press H or choose Hide words and recall. This removes the visible answer list from the page before the answer field appears; the answer is not merely blurred, recolored, or moved aside. Inspecting the recall area therefore does not reveal the sequence.
- Type the complete chain from the beginning. Enter every word shown for that round, separated by whitespace. Capital letters and extra spaces are safe, but keep each word distinct and do not add punctuation or digits.
- Press Enter to submit. If you are using a pointer or touch device, select the labeled Check control instead.
- Read the live feedback. The game distinguishes correct, wrong, duplicated, invalid, complete, and closed states. A correct chain awards exactly 200 points and advances to a new Reveal state.
- Repeat the reveal-and-recall process through all five rounds. Each round contains all earlier words plus one new word, so later entries grow longer even though the required order stays unchanged.
How wrong attempts and repeated answers work
A first distinct wrong recall is recoverable. If you submit the same normalized wrong sequence again, the game recognizes it as a repeat and does not consume another error. Repeating the mistake does not advance the round or repair the answer, so a different reconstruction is needed if you want to continue.
A second different wrong sequence closes the run in a visible deadlock. At that point, answer and phase actions freeze. Restart is the explicit recovery path: it restores round one, a score of zero, zero errors, and the first Reveal state.
Invalid entries are handled separately. Punctuation, digits, and blank submissions are harmless no-ops, so they should not be confused with a wrong chain that has been checked against the target. Capitalization cannot rescue a missing word, extra word, incorrect spelling, reversed order, or a glued boundary; however, you can repair a glued entry by changing “emberharbor” to “ember harbor.”
A reliable way to type the five chains
- Use lowercase if that is easier. Matching the capitalization of the visible blocks is optional.
- Prefer one space between words. Repeated spaces are accepted, but a single space makes the boundary count easier to review.
- Count visible blocks, not letters. The number of words in your entry should match the number of blocks you saw.
- Start with the original word. Recalling only the newly added token is the most common way to submit an incomplete chain.
- Check the first and last words before submitting. This catches a reversed sequence or an omitted final token without changing the rules.
If your first distinct attempt is wrong, reconstruct the sequence from the start rather than submitting another unrelated guess. The same wrong answer entered twice is ignored as a duplicate, while a second different mistake causes the deadlock. A restart can be used whenever you want to return to the first Reveal state with a clean score and error count.
The disclosed chain is identical on every load, so there is no random word sequence to decode. The challenge is the cumulative recall itself: remembering every earlier word, adding the newest one, and preserving the exact boundaries.
Scoring, session limits, and fixed behavior
Each correct chain is worth exactly 200 points, and five correct recalls produce exactly 1,000 points. There is no timer bonus, random multiplier, speed penalty, or hidden difficulty adjustment. Capital letters and extra spaces do not change the score because normalization occurs before the chain is evaluated.
Word Chain Memory is designed as a short, repeatable browser break. It runs locally in the page and requires no account, upload, microphone, camera, model, or remote word service. The browser stores only the shared best completed score; your current input and round state disappear when the page is closed or restarted.
The practical rule is simple: format the answer with confidence, but preserve the content. Use any capitalization and add extra spaces if needed, while keeping every word separate and in its original position. For another game with a different name or format, verify that product’s validator instead of assuming that its rules are identical.
Related reading: Word Family vs Word Root: Differences and Examples.
Related reading: Does Word Grouping Depend on Subjective Word Meanings?.