Introduction
The word letter change solver finds words that differ from a given word by exactly one letter. Enter a word like COLD and the tool returns all valid English words that can be made by changing a single letter: BOLD, CORD, COLT, GOLD, HOLD, MOLD, and more. The tool also includes a word ladder solver that finds the shortest sequence of words connecting two words, where each step changes exactly one letter. For example, the ladder from COLD to WARM goes COLD to CORD to WORD to WARD to WARM. The tool uses a dictionary of English words sourced from Scrabble and Wordle word lists, indexed by word length for fast lookup. Everything runs in your browser.
What this tool does
- Finds all valid English words that differ from the input word by exactly one letter, sorted alphabetically.
- Solves word ladders by finding the shortest sequence of words from a start word to an end word, where each step changes exactly one letter.
- Uses a combined dictionary of English words sourced from Scrabble word lists (2 to 4 letters) and Wordle word lists (5 letters), plus a general English word list.
- Indexes words by length for efficient lookup, so the search only compares words of the same length as the input.
- Uses breadth-first search (BFS) for the word ladder solver to guarantee the shortest path between two words.
- Displays results as clickable word chips with arrow separators showing the ladder path, and a copy button for easy export.
How this tool works
The tool has two tabs. The One Letter Change tab takes a single word and finds all dictionary words of the same length that differ by exactly one letter. The Word Ladder tab takes a start word and an end word and finds the shortest sequence of words connecting them, where each step changes one letter.
For the one letter change search, the tool retrieves all dictionary words of the same length as the input and compares each one letter by letter. If exactly one position differs, the word is included in the results. The search is fast because the dictionary is indexed by word length, so only words of the correct length are compared.
For the word ladder solver, the tool uses breadth-first search (BFS). Starting from the start word, it generates all possible one-letter variations and checks which ones are valid dictionary words. Each valid variation becomes a node in the search tree. The search continues level by level until the end word is found, guaranteeing the shortest path. The search is limited to ladders of 20 words to prevent excessive computation.
The dictionary combines three sources: Scrabble short words (2 to 4 letters from CSW21 and NWL2023 lists), Wordle words (5 letters from the NYT answer and guess lists), and a general English word list. All words are converted to uppercase and deduplicated. The combined dictionary contains tens of thousands of words across all supported lengths.
How the cipher or encoding works
A word letter change puzzle asks: given a word, what other valid words can you make by changing exactly one letter? For example, changing the C in COLD to B gives BOLD, changing the O to O (no change) is invalid, changing the L to R gives CORD, and changing the D to T gives COLT. The puzzle is a staple of word games, vocabulary exercises, and competitive word puzzles.
The word ladder, also known as a word chain, was invented by Lewis Carroll in 1877. Carroll described it in his book "Doublets" published in 1879. The puzzle challenges the solver to transform one word into another by changing one letter at a time, with each intermediate step being a valid word. Carroll's original example was transforming APE into MAN: APE, APT, OPT, OAT, MAT, MAN.
The dCode website provides an online word letter change solver with configurable dictionaries in multiple languages. The dCode word ladder generator finds the shortest path between two words. The HackerPoet/WordChainSolver GitHub project provides a Python implementation using BFS with a configurable dictionary.
The word ladder problem is a classic application of breadth-first search in graph theory. Each word is a node in a graph, and two nodes are connected by an edge if the corresponding words differ by exactly one letter. Finding the shortest word ladder is equivalent to finding the shortest path between two nodes in an unweighted graph, which BFS solves optimally.
The time complexity of the one-letter-change search is O(N times L) where N is the number of words of the same length and L is the word length. For the word ladder, BFS has a time complexity of O(V + E) where V is the number of words (vertices) and E is the number of one-letter-change edges. In practice, the search is fast for short words (3 to 5 letters) because the dictionary is relatively small for each length.
The word letter change puzzle is related to several other word puzzles. The Wordle solver finds words matching a pattern of known and unknown letters. The anagram solver finds words that can be made by rearranging all the letters of a word. The word scramble solver unscrambles jumbled letters into valid words. The word letter change is unique in that it preserves the position of all but one letter, making it a positional constraint puzzle rather than a rearrangement puzzle.
How to use this tool
- For one letter change: enter a word in the input field. The tool finds all dictionary words that differ by one letter.
- For word ladder: switch to the Word Ladder tab, enter a start word and an end word of the same length.
- Review the results. One letter change shows all matching words as chips. Word ladder shows the shortest path with arrows.
- Click Copy to copy the results to your clipboard.
- Try different words to explore the word graph. Common words like COLD, WARM, and LIGHT have many one-letter neighbors.
Real-world examples
Finding one-letter changes for COLD
A word puzzle enthusiast wants to find all words that can be made by changing one letter of COLD. They enter "COLD" in the One Letter Change tab. The tool searches the dictionary and returns: BOLD, CORD, COLT, CLOD, GOLD, HOLD, MOLD, WOLD, COLD (excluded), and others. Each result differs from COLD by exactly one letter position. The enthusiast uses this list to solve a word chain puzzle in a newspaper.
Solving a word ladder from COLD to WARM
A student is working on a word ladder puzzle that requires transforming COLD into WARM by changing one letter at a time. They enter "COLD" as the start word and "WARM" as the end word in the Word Ladder tab. The tool uses BFS and finds the shortest path: COLD, CORD, WORD, WARD, WARM. Each step changes exactly one letter, and every intermediate word is a valid English word. The student copies the result and submits the puzzle.
Exploring the word graph for LIGHT
A vocabulary teacher wants to show students how connected English words are. They enter "LIGHT" in the One Letter Change tab and the tool returns dozens of words: FIGHT, MIGHT, NIGHT, RIGHT, SIGHT, TIGHT, EIGHT, LIGHT (excluded), LEGIT, and more. The teacher uses this to demonstrate that changing one letter connects many common words, and challenges students to find ladders between pairs of these words.
Comparison with similar methods
| Method | Complexity | Typical use |
|---|---|---|
| Word letter change | O(N*L) per search, N = words of same length, L = word length | Word puzzles, vocabulary exercises, word chain games |
| Word ladder (BFS) | O(V+E) graph traversal, V = words, E = one-letter edges | Lewis Carroll doublets, puzzle hunts, educational games |
| Anagram solver | O(N) dictionary lookup with sorted letter keys | Scrabble, anagram puzzles, word jumble games |
| Wordle solver | O(N) filtering by pattern constraints | Wordle, word guessing games, pattern matching |
Limitations or considerations
The tool uses a fixed dictionary of English words sourced from Scrabble and Wordle word lists. The dictionary does not include every English word, so some valid one-letter changes may not be found. Proper nouns, abbreviations, and obscure words are generally not included. The dictionary is strongest for 3 to 5 letter words, where the Scrabble and Wordle lists are comprehensive.
The word ladder solver uses BFS with a maximum ladder length of 20 words. If no path exists within 20 steps, the tool reports that no ladder was found. This can happen when the start or end word is not in the dictionary, or when the two words are in disconnected components of the word graph. Words with unusual letter patterns (like JAZZ or BUZZ) may have few or no one-letter neighbors, making ladders impossible.
The tool only handles words of the same length. It does not support word ladders that add or remove letters, which is a variant of the puzzle sometimes called a "word chain with length change." Both the start and end words must have the same number of letters.
The one-letter-change search compares each candidate word letter by letter, which is efficient for short words but may be slow for very long words (8 or more letters) if the dictionary contains many words of that length. The tool is optimized for the common case of 3 to 7 letter words.
Frequently asked questions
What is a word letter change puzzle?
A word letter change puzzle asks you to find all valid words that can be made by changing exactly one letter of a given word. For example, changing one letter of COLD can produce BOLD, CORD, COLT, GOLD, HOLD, MOLD, and other words. The puzzle is a staple of word games and vocabulary exercises.
What is a word ladder?
A word ladder, also known as a word chain or doublet, is a sequence of words where each word differs from the previous one by exactly one letter. The puzzle was invented by Lewis Carroll in 1877. The challenge is to transform a start word into an end word through a series of valid intermediate words. For example, COLD to WARM can go: COLD, CORD, WORD, WARD, WARM.
Who invented the word ladder?
The word ladder was invented by Lewis Carroll, the author of Alice in Wonderland, in 1877. He described it in his book "Doublets" published in 1879. Carroll's original example transformed APE into MAN through the ladder APE, APT, OPT, OAT, MAT, MAN. The puzzle became popular as a parlor game and has since been used in education and competitive word puzzles.
How does the word ladder solver find the shortest path?
The solver uses breadth-first search (BFS), a graph traversal algorithm that explores all nodes at the current depth before moving deeper. Starting from the start word, it generates all one-letter variations and checks which are valid dictionary words. Each valid word becomes a node in the search tree. BFS guarantees the first path found to the end word is the shortest possible path.
What dictionary does the tool use?
The tool uses a combined dictionary of English words sourced from Scrabble word lists (CSW21 and NWL2023 for 2 to 4 letter words), Wordle word lists (NYT answers and valid guesses for 5 letter words), and a general English word list. All words are converted to uppercase and deduplicated. The dictionary is strongest for 3 to 5 letter words.
Why does the tool say no word ladder was found?
The tool reports no ladder found when the start or end word is not in the dictionary, or when no path exists between the two words within 20 steps. This can happen with words that have unusual letter patterns (like JAZZ or BUZZ) that have few one-letter neighbors. Try using more common words or words of a different length.
Conclusion
The word letter change solver is a versatile tool for word puzzles, vocabulary exercises, and word ladder challenges. For related word puzzle tools, see the Wordle solver, the anagram solver, and the word scramble solver. For cipher tools, try the Caesar cipher decoder or the substitution cipher solver.