Building a Word Ladder Solver with BFS in JavaScript
TINY and MEND differ in three letter positions. But in my game's dictionary, the shortest valid transformation takes four moves. That extra move is a useful example of why a word ladder needs a graph