Solver Engineering articles

Word Unscrambler and WWF Solver: Installable Apps, Smoother Searches

A word solver should help you move from a rack of letters to a useful decision without making you wrestle with the interface. You should be able to find candidates, understand their scores, compare what they leave behind, and prepare the next rack. Our latest updates bring that workflow to the Word Unscrambler and Words With Friends Solver. Both can be installed as individual apps, open directly …

How We Built Anagram Architect: Meaningful Anagrams with Rust and WebAssembly

An exact anagram uses every letter from the original text once and only once. That rule sounds simple. The difficult part is finding a result that sounds like something a person might actually say. Consider a few of the phrases we used while developing Anagram Architect: Osama Bin Laden → Old man in a base The meaning of life → The fine game of nil Acorn computers → Crap on customer President …

Why an Absurdle Solver Is Technically Difficult to Build

Absurdle looks almost exactly like Wordle: five-letter guesses, gray/yellow/green tiles, and eventually one completed word. The adversarial part is invisible. Behind the board, Absurdle begins with a pool of possible answers rather than committing to one secret word. After each guess, it returns feedback that preserves a difficult compatible family. Every reply remains consistent with the full …

Why the MonkeyTactics Crossword Solver Is Different

Why this matters Most crossword solvers are built around one of two ideas. Some search a large archive of clue-and-answer pairs from previously published puzzles. Others take the letters you already know and return dictionary words that fit the pattern. Both approaches are useful. They also leave a gap. What happens when the exact clue is not in an archive, the answer is a phrase rather than a …

How We Built a Four-Board Quordle Solver with Rust, WebAssembly, and Entropy

Quordle looks like four Wordle boards placed beside one another. That description is visually accurate—and computationally incomplete. Every guess is shared across four independent answers. Each board returns its own green, yellow, and gray pattern. A useful next move must therefore do more than fit one set of clues: it should reduce uncertainty across every board that remains unsolved. That is …