Change one letter at a time
Build a chain from the start word to the target. Every rung must keep the same length, form a valid word, and differ from the previous rung in exactly one position.
Everyone solves the same start-to-target challenge each UTC day.
Lexora checks the shortest distance before a ladder is published.
The displayed route is never the only accepted solution.
Rules
- Begin with the displayed start word.
- Change exactly one letter position.
- Submit a real word of the same length.
- Repeat until the target is reached within the move limit.
Move validation
| One letter | Exactly one position must differ. |
|---|---|
| Real word | Every intermediate rung passes dictionary validation. |
| Same length | Letters cannot be inserted or removed. |
| Invalid rung | Rejected without using a move. |
How to solve a word ladder
Compare the start and target first. If several positions differ, look for a common intermediate word that fixes one target letter without trapping the remaining positions. Work backward from the target when its neighboring words are easier to recognize, and keep familiar vowel changes available for the final step.
Par is calculated with a breadth-first search across the accepted dictionary. Any equally short route—or any other valid route within the displayed limit—is accepted.
Word Ladder FAQ
What does par mean?
Par is the verified shortest number of valid one-letter changes between today’s start and target.
Are alternative paths accepted?
Yes. Any route is accepted when every intermediate word is valid, each move changes one letter, and the target is reached within the limit.
Does an invalid word use a move?
No. A word outside the dictionary or a rung changing more than one position is rejected without consuming a move.
Is the daily word ladder free?
Yes. Play online without an account, subscription, or download.