Name anagram transformation proof

A resemblance is not a transformation

An anagram clue makes a precise promise: the reader can rearrange a stated collection of symbols into another collection without losing an inconvenient occurrence. A name that looks close to the answer may still fail that promise. Two strings can contain the same kinds of letters and different numbers of them. This workbench checks the inventory and records how each occurrence participates in the proposed transformation.

Use it while constructing a name-based clue, before polishing the reveal. Supply the candidate names, visible clue token, comparison policy and any explicitly permitted additions or removals. The output is an inspectable proof or a mismatch report. It does not generate literary puns, infer pronunciation, search for quotations or decide whether a reader could fairly discover the operation.

The suspect-roster tool asks who remains under supplied clue conditions. This page asks whether the transformation itself works and how to demonstrate it without hiding extra operations. It can support a puzzle that has no suspect at all: a dedication, a stage credit, a museum trail or a playful exchange between characters. An inventory match does not identify a real person or establish guilt.

Read the repeated letters before reading the solution

The default name Mira Vale and the visible token A Rival Me have equal inventories when spaces and case are ignored. Both contain two occurrences of a and one each of e, i, l, m, r and v. The candidate Mira Vell is close in appearance, but it has one extra l and one missing a relative to the target. The proof reports those quantities instead of accepting a similar set of letters.

Try the smaller pair aab and abb. Their sets of distinct symbols are identical: a and b. Their counts are not. A set-only check would discard exactly the evidence that makes this pair fail. Repeated-symbol deficits are often where a plausible draft clue breaks, especially after a name has been revised for another part of the story.

Inspect both surplus and deficit. An extra letter in the source and a missing letter in the source are different directions of the same mismatch. Neither authorizes the program to choose a replacement letter. If the intended operation really changes one symbol, declare a removal and an addition, and give the reader an appropriate way to learn that operation.

Choose what counts as the same symbol

The comparison proceeds in a stated order. You can preserve the original code points or apply NFC first. You can then preserve case or lowercase the string, remove Unicode whitespace and remove Unicode punctuation. The inventory unit is a Unicode code point after those steps. It is not a count of visual glyphs, spoken sounds, syllables or culturally equivalent names.

NFC can change the encoded representation of a character sequence; it is not transliteration or an accent-removal option. Lowercasing is the program's Unicode lowercase operation, not a language-specific interpretation of the clue. Some transformations can change the number of code points. The report therefore keeps the raw strings beside the normalized strings rather than pretending their positions are interchangeable.

The punctuation option removes characters classified as punctuation. It does not mean remove every mark that is not a letter. A mathematical plus sign can remain. A character that looks like a Latin letter is not automatically converted to one from another script. If your puzzle needs a different convention, establish and implement it deliberately; a visual resemblance is not an undocumented comparison rule.

Keep the original spelling even when comparison ignores it

Ignoring spaces may be sensible for a letter-rearrangement puzzle, but those spaces still belong to the name's presentation. The report retains Mira Vale as the exact candidate while comparing miravale under the default policy. A successful proof does not propose miravale as the character's new personal name or authorize a different spelling in the manuscript.

The occurrence map points into the normalized source. It cannot reconstruct discarded raw punctuation or whitespace from those positions alone. The raw input is retained separately. This distinction matters when passing a proof to an illustrator: a numbered mapping for normalized letters is not an instruction to move the ninth printed glyph in an ornate logo.

Keep editorial identity decisions outside the convenience of a puzzle. If the established character needs a particular spelling, do not quietly drop a letter to make the reveal work. Change the clue, declare a supported operation or choose a different naming device. A formally elegant solution can still be a poor revision when it breaks the character's earlier identity and references.

Original fictional scene: the proof copy at the museum desk

The museum's afternoon trail ended beside a donated miniature theater. Visitors were meant to rearrange A Rival Me into the maker's credit, Mira Vale. The trail designer liked that the answer returned attention to the person whose name was printed in small type below the display.

At the desk, an assistant tried the clue using a proof copy of the visitor booklet. Its credit read Mira Vle. One a had disappeared while the booklet was being reset. The assistant laid out the letters and found one left over. The designer initially treated the problem as an unhelpful test attempt; the draft answer sheet said the transformation was exact.

They compared occurrences rather than impressions. The clue contained two a letters. The booklet's damaged name contained one. No amount of rearranging could account for the second occurrence. The assistant had followed the proposed operation correctly. The contradiction belonged to the printed materials.

The designer considered adding an instruction to discard a letter. That would make a different puzzle, and the booklet still would not give the maker her correct credit. Restoring the missing letter repaired both the naming decision and the promised operation. The new proof copy carried Mira Vale, and the answer sheet could show where every occurrence went.

A later suggestion replaced the name with Mira Vell for a fictional adaptation of the exhibit. The designer did not assume that a similar-looking replacement preserved the puzzle. This time the source had an extra l and a missing a relative to A Rival Me. The team either needed a new clue token or a clearly taught change of operation.

They kept the museum trail and the fictional adaptation in separate project files. The first credited its invented maker consistently; the second could make its own naming decision without borrowing an obsolete solution key. The assistant's failed attempt stayed in the production notes as evidence of the original mismatch, not evidence that the test reader was incapable.

This is an original fictional scene. No real museum, visitor test or artist's identity is being reported. The name matters because it is a credit owed to a particular maker inside the story. Treating an inconvenient letter as disposable would change both the formal puzzle and the act of recognition the ending was supposed to provide.

If the maker had another name

A different name with the same inventory could satisfy the same letter proof. That would not make it the same maker or an equally suitable credit. The scene needs a separate reason for associating a particular string with the exhibit. An exact rearrangement supplies a transformation, not the identity relationship that makes its destination meaningful.

A different name with merely similar spelling can break the transformation, as Mira Vell does. Before accepting a rename elsewhere in the manuscript, rerun the proof and inspect all printed surfaces that show the candidate or clue. Keeping the answer paragraph while changing the name can create a contradiction that a normal spelling check will never find.

Apply the counterfactual in two passes. First test the symbols under the declared policy. Then read the destination as a naming decision: whose credit, identity or relationship does it establish? A formally valid replacement can be narratively wrong, while a narratively desirable replacement may require rebuilding the puzzle. Neither pass substitutes for the other.

Declare an edit instead of smuggling it into an anagram

Pure mode requires the added and removed fields to be empty, including characters that your comparison policy would later ignore. It is a clear contract: rearrange the normalized source without a declared insertion or deletion. If you need another operation, choose the declared-edit mode and supply its symbols explicitly.

The declared operation removes the requested occurrences from the normalized source, adds the supplied occurrences and only then compares inventories with the target. If a removal requests a symbol that the candidate does not have, that candidate fails the operation. An unavailable removal is not silently skipped, even if skipping it would happen to leave a matching inventory.

For example, turn aab into abc by declaring removal of one a and addition of c. The proof identifies the removed source occurrence and the added target occurrence. It labels the result as an edited transformation, not a pure anagram. This mechanical success does not demonstrate that your clue gives the reader a fair reason to make those two edits.

Follow occurrences, not interchangeable letter types

For a matching candidate, the target map identifies each target position and the source occurrence or added occurrence used there. When identical symbols offer several possible mappings, the engine uses the first remaining source occurrence deterministically. This is one reproducible proof; it does not claim that the arrangement is the only possible mapping.

The inverse check puts mapped source occurrences and declared removals back into their normalized source positions. It verifies reconstruction of that normalized string. Added occurrences have no original source position. The raw name remains available independently, so the report does not exaggerate what the inverse operation can recover after comparison normalization.

A mismatch has no successful target map. It retains the inventories and the missing or extra counts instead. Do not draw arrows implying a completed proof for those candidates. The unresolved quantities are the useful result: they show exactly what the writer must change, disclose or abandon before claiming a reversible transformation.

Give readers the clue, keep the solution key separate

The dedicated reader sheet contains only the authored public clue, visible token and authored rule hint. It omits candidate records and occurrence maps. The private transformation proof contains candidate names, inventories, raw edits and mappings. A visible-results export or a project export belongs with author materials because it can include the solutions.

This separation is structural. The tool cannot recognize that you have accidentally written the answer into the public clue or hint. Read the actual reader sheet before sharing it. Likewise, a hint saying rearrange letters does not automatically explain a declared deletion. Compare the authored instructions with the operation you actually verified.

Fairness also depends on when the reader sees the relevant spelling, whether the printed form is legible, which conventions the story has taught and whether multiple candidates remain plausible. The workbench makes no fairness score. Test those questions in the actual passage and preserve the difference between a known formal error and an unsupported guess about reader behavior.

Finish with a reproducible production check

The local scope is one to fifty named candidates, each up to two hundred raw code points. The target and each edit field allow up to five hundred code points, and the clue and hint allow up to two thousand each. Empty normalized targets, malformed records, duplicate IDs and unsupported policies return explicit conflicts. A candidate that becomes empty is retained as a failed candidate rather than invented into a new name.

Save the project with its raw spellings and policies. After a rename, typography change or clue revision, reopen that project and compare the actual materials again. A previous successful inventory proves only the strings and rules that were checked then. It is not permanent approval for a later edition.

The finished creative result is a name that still belongs to the intended person, a reader operation the story actually teaches and a proof that accounts for every occurrence. When those disagree, the mismatch report is more valuable than a decorative list of almost-anagrams.

Does the same set of letters prove an anagram?

No. Repeated occurrences must have the same counts under the stated policy. aab and abb have the same distinct-symbol set but different inventories.

Does NFC remove accents or translate a name?

No. This workbench uses NFC as an encoded-text normalization option. It does not transliterate scripts or invent cultural equivalence, and the raw spelling remains separate.

Can I call an edited result a pure anagram?

The tool labels additions and removals as declared edits. A successful edited inventory does not become a pure rearrangement, and the reader needs a supported way to learn the extra operation.

Does the reader sheet guarantee that the answer is hidden?

It excludes solution fields and candidate records. It cannot detect an answer you placed in the authored clue or hint. Inspect the actual sheet before sharing; other exports contain author information.