#word-ladder

A word game starts from the word O and adds or removes one letter per move; every intermediate word must be in the list. The moves allowed are the edges O–ON, O–OW, ON–ONE, ON–TON, OW–TOW, ONE–TONE, TON–TONE, TON–TONS, TON–TOWN, TOW–TOWN, TOW–TOWS, TOW–TROW, TONE–TONES, TONS–TONES, TONS–TOWNS, TOWN–TOWNS, TOWS–TOWNS, TOWS–TROWS, TROW–TROWS, TROW–THROW, THROW–THROWS and TROWS–THROWS. Run breadth-first search with an extended list from O to THROWS, taking neighbors in dictionary order. Which path is found?