What it is
Enter the letters you've been dealt and it finds every word you can actually build, then draws each one out on the board so you can copy the moves in order.
The catch is that it isn't just an anagram check — tiles are locked horizontal or vertical, so a word only counts if the pieces physically fit together, which the solver works out by backtracking through the placements. Results are sorted by length or point value so you play the highest scorer first.
How it works
Not an anagram check
Tiles are locked horizontal or vertical, so a word only counts if the pieces physically fit on the board.
Backtracking search
The solver works placements out by backtracking, so every result it returns is genuinely playable.
Sorted for scoring
Results sort by length or point value, and each word is drawn on the board so you can copy the moves in order.
Built with
TypeScript · React · Vite · Tailwind
· Algorithms / web application — built by Musa Alanssari, a software engineer in Houston, Texas. Jun 2026.