Word Ladder Game
Weaver Solver
Type your start and end words. The solver auto-detects word length and finds the shortest path — no button needed.
Starting Word
Destination Word
What the Weaver game actually is
Weaver gives you two words of the same length and asks you to get from one to the other by changing exactly one letter per step. Every intermediate word has to be real. COLD → CORD → WORD → WARD → WARM is a classic example — four steps, four valid words.
The daily version picks one word pair. You try to beat it in fewer steps than the par. Some pairs have an obvious path. Others send you hunting through less common words before you find the right bridge.
The concept goes back to 1879. Lewis Carroll invented it and called them Doublets, published in Vanity Fair magazine. His first example: HEAD → HEAL → TEAL → TELL → TALL → TAIL. Same rule, same structure — just no leaderboard.
When the path isn't obvious
Short words look easy. Three-letter pairs like CAT → DOG feel approachable, but CAT and DOG share no letters. You need a bridge word, then another, then another. CAT → BAT → BAD → BAG → BOG → DOG — five steps for what looked like a simple hop.
Longer words have more letters to change but also more options at each step. A seven-letter word can swap any of seven positions, each producing a potential neighbor. The search space is bigger, but there are also more paths through it.
The hardest puzzles involve words with unusual letter patterns — lots of uncommon consonants, or vowel combinations that only appear in a few words. There might be only one valid intermediate word at a certain step, and if you don't know it, you're stuck.
How the solver finds the shortest path
The solver uses bidirectional breadth-first search. It explores outward from both the start word and end word at the same time and stops the moment the two fronts meet. This is faster than searching from one end alone, especially for longer words.
BFS guarantees the shortest path. It checks every path of length N before any path of length N+1. The first time a word appears in both frontiers, that's the meeting point — and you know it's optimal because no shorter path could have been missed.
The word graph is built by comparing every word of the target length to every other. Two words are connected if they differ by exactly one letter. For 4-letter words, that graph has tens of thousands of edges. The solver navigates it in under a second.
Patterns that actually help
Work from both ends
Think about what words are one step from your start, and what words are one step from your target. If any word appears on both lists, you've found a two-step path.
Change vowels last
Consonant swaps tend to preserve word meaning and stay in the dictionary. Changing the vowel often jumps into a different word family with fewer connections.
Know your three-letter words
Short words like OAT, EAT, EAR, OAR, OAK form dense clusters. If your path goes through one of these, you often have several options for the next step.
Avoid rare words as bridges
A valid dictionary word isn't always useful. If only one other word connects to it, it's a dead end in disguise. Look for words with many neighbors.
Use the solver to learn
After you've tried a puzzle, look at the solver's path. Pay attention to which bridge words it chose. Those words tend to be highly connected — knowing them helps on future puzzles.
Why some word pairs have no path
Not every pair of same-length words is connected. The word graph can have disconnected components — islands of words that can only reach each other and not the broader network.
Unusual words with uncommon letter patterns often end up isolated. They might have only one or two neighbors in the graph, and those neighbors might not connect back to the main component.
The daily Weaver game is designed to avoid this. Puzzle creators pick pairs from the connected core of the word graph. If the solver tells you no path exists, one of your words is probably spelled differently than expected, or it's not in the dictionary the solver uses.
Weaver Solver FAQ
What is Weaver?
Weaver is a daily word ladder game where you change one letter at a time to get from a start word to a target word. Every step must be a real word. The goal is to do it in as few steps as possible.
How does the Weaver Solver work?
Type your start word and end word. The solver detects the word length, loads the right word list, and runs a breadth-first search to find every shortest path between the two words. Results appear automatically — no button needed.
What word lengths does the solver support?
The solver handles 3 to 12 letter words. Both words must be the same length. Type them in and the correct word list loads automatically.
Why does the solver show multiple paths?
Sometimes there are several routes of equal length between two words. The solver shows up to 5 shortest paths so you can pick the one that uses words you prefer.
What happens when no path exists?
Some word pairs have no valid connection in the dictionary. If that happens, the solver tells you directly. It means there is no sequence of single-letter changes that connects those two words through real words.
Is this the same algorithm as the Weaver game uses?
The solver uses bidirectional BFS, which is faster than a single-direction search. It explores from both ends simultaneously and stops when the two fronts meet. The result is always the true shortest path.
Can I use this for any word ladder puzzle, not just Weaver?
Yes. The underlying algorithm works for any word ladder problem. If you have a word pair from a different game or puzzle book, just type them in. As long as both words are the same length and in the dictionary, the solver will find the path.