Board Rack Letter Multiset Check
Check literal uppercase ASCII rack multiplicities against a word; no dictionary, blank tiles, scoring or language inference.
Description
Check literal uppercase ASCII rack multiplicities against a word; no dictionary, blank tiles, scoring or language inference.
Forming a word from a letter rack requires enough occurrences of every letter. A deficit table distinguishes quantity from mere presence.
When to use this tool
Check literal uppercase ASCII rack multiplicities against a word; no dictionary, blank tiles, scoring or language inference.
- Prepare the supplied rack, word fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter rack, word. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.canForm, result.deficit. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require rack and word to contain uppercase ASCII A through Z only. Group word letters, subtract rack counts and return positive missing quantities; canForm means no deficit.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| rack | rack. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| word | word. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.canForm | Whether the rack contains at least the required count of every word letter. |
| result.deficit | The deficit list in the ordering and representation described above. |
{
"input": {
"rack": "AABC",
"word": "ABBA"
},
"output": {
"result": {
"canForm": false,
"deficit": [
{
"letter": "B",
"missing": 1
}
]
}
}
}Limitations and assumptions
- Blank tiles, lowercase conversion, dictionaries and game scoring are not handled. Empty words can be formed under the count rule.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Lists are limited to 128 entries. JSON text must meet bounded size and depth checks, and numeric outputs beyond the safe finite magnitude are rejected. Exact large integers use decimal strings.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Use a game-state-aware rules engine when occupancy, legal moves or scoring rules matter. These operations calculate coordinates, local geometry or supplied ledger totals without inferring a complete position.
References
Similar or alternative tools
- Board Captured Piece Ledger
Aggregate explicit captured-piece events by side and piece name; no inferred moves, scoring or game legality.
- Board Cell Checker Parity
Compute abstract checkerboard cell parity on nonnegative integer coordinates; does not assign chess color names.