Word Ladder Game
Move from a start word to a target word by replacing exactly one letter at each step. Only the words in your supplied list are allowed. Korean compares one NFC-composed Hangul syllable per character; English compares one A–Z letter with case folded. The list is not presented as a complete English or Korean dictionary.
Key features
- Create puzzles from a permission-checked user list or a separately labeled small original example
- Distinguish exactly one character replacement, missing words, repeated steps, and length errors
- Calculate BFS shortest distance and total number of tied shortest paths, showing only the first eight
- Keep unreachable targets distinct from time or edge inspection limits
- Get remaining-route hints that avoid visited words, undo steps, and restart
- Download a local JSON report with source, word list, move trail, and analysis
How to use
- Select Korean or English and enter the start, target, and equal-length words on separate lines.
- State the list's source and confirm permission to use it, or load the small original example.
- Create the puzzle to see BFS shortest distance, tied route count, or unreachable status.
- Enter one-letter list words to move, and use a hint, undo, route reveal, or JSON download if needed.
Use cases
- Make a classroom word-chain problem from a small chosen vocabulary
- Compare several routes with the same minimum number of moves
- Check whether a candidate move follows both the letter and allowed-list rules
Frequently asked questions
Which words count as valid moves?
Only equal-length words in your list that differ from the current word by exactly one character. English is case-insensitive A–Z; Korean compares NFC-composed Hangul syllables.
Do you provide a complete dictionary?
No. You supply a list that you wrote or may use. The bundled example is a tiny, originally selected teaching list, not a general dictionary.
What if there are several paths?
BFS counts all shortest paths and displays the first eight in lexical order. A longer valid route still completes the game when it reaches the target.
What if the target is unreachable?
The chosen list is marked unreachable so you can add words or change endpoints. A time or inspection limit is reported separately, without claiming unreachable or optimality.
Are my words sent to a server?
No. Processing stays in the browser. A JSON report containing your source, words, and moves is saved locally only when you request it; you decide whether to share that file.
Privacy
The supplied list, source, and moves are processed only in this browser and are not automatically saved or sent to the server. The optional JSON download is a file you choose to keep locally.
Comments & questions