How to Find Every 3-Letter Word Hidden Inside "WORD"
The straightforward answer is that you can rearrange the letters W-O-R-D to make three common English words: ROW, ROD, and OWL. That last one only works if you're willing to swap the D for an L, which defeats the puzzle, so stick with ROW and ROD. If you want every possible permutation checked, including Scrabble-valid garbage, there's a quick process. Here is how I actually do this when someone drops a four-letter word on a forum or puzzle help thread and asks for every 3-letter combination. First, list out every permutation of three letters drawn from your four source letters. With four letters, the math is simple: four choices for the first position, three for the second, two for the third. That gives you 24 total arrangements. I don't write them all down by hand anymore. I used to, back when I was helping people with crossword construction out of a shared apartment in 2011 and we had no internet access. Now I just run a short script or use a free online anagram solver.
The arrangements from W-O-R-D look like this when you generate them systematically: ROW, RDO, ROD, ORD, OWR, ORW, OW R, ODR, DOR, DRO, DOW, DWO, WOR, WRO, WOD, WDO, WRD, WDR. Now filter that list against a dictionary. ROW, ROD, and WRO are your valid Scrabble words. WRO appears in some dictionaries as an archaic past tense of "work," but most modern word lists drop it. If you're playing Wordle or a similar game, only ROW and ROD matter. If you're doing crossword work and need fillers, WRO can save you from having to use weird abbreviations.
I hit a wall once trying to help a friend build a small puzzle where the answer key required every 3-letter word from a given set, and the source word was something like "STRAW." The brute-force permutation approach gave 60 arrangements, but half of them weren't real words. The workaround was to stop treating it as a pure math problem and instead run the permutations through a validated word list file. I used a plain-text dictionary with about 175,000 entries and grepped it. Cuts the manual checking time from roughly 20 minutes to under a minute. For most people who just want the answer without running code, here are the useful ones from "WORD": ROW and ROD. That's it for standard gameplay. If you need more depth or are building a tool around this, the greedy approach of generating all permutations first and then filtering against a dictionary is the method that actually scales. Trying to hand-check every arrangement gets sloppy fast past four-letter source words. One thing beginners miss: the order of letters in the source word doesn't change the result. "DROW" produces the exact same set of 3-letter words as "WORD." People often waste time rechecking because they think rearranging the source word changes the output. It doesn't. An anagram is order-independent by definition.
Get the Full Details
Another practical note: this method breaks down when you start dealing with repeated letters in the source word. If your source is "DEED" instead of "WORD," the permutation count drops from 24 to 12 unique arrangements because swapping the two E's doesn't create a new arrangement. Most online solvers handle this automatically, but if you're writing your own, you need to account for duplicates or you'll report inflated counts.
