a solver for any challenge of the weaver game. the game can be played at wordwormdormdork.com or weaverwordle.com. the game is a "word ladder" game.
you have to weave your way from the strating word to the ending word. each word inbetween can only change 1 letter from the word above.
check out the tutorials on wordwormdormdork.com or weaverwordle.com, they have a very comprihelsible explanation.
sadly, not all words can be connected. some words have no connections at all (like envy, or iglu) and other words are part of only a small group (like icon, iron, ikon or oxid, oxim). if this happens during a real game though (where a solution must be present), please open an issue.
if this happens, it likely is an issue with the search algorithm. please open an issue if you find a case, where the calculation is wrong. I will look into it as soon as I find the time.
This is a really interestig problem to solve, because the computation neccessary to connect every word with each other grows large very quickly. the answer is 17 steps! the paths include unau -> whoa, unau -> atom, unau -> inch, and a few more. unau is a type of sloth by the way, and yes it is part of every of these longest paths.
in the code, there is a list of all possible words. While searching, we do a bidirectional BFS, meaning a breadth-first search from both ends of the weave until we meet in the middle and find a valid path from one to the other. due to the paths having no weights, and the branching nature of the graph, this is a really fast and efficient approach.
because I'm better at coding than I am at english word games.