Wordward Draw

Normally I would agree, but for some reason, the width threshold for going from desktop -> mobile is really wide (1280px) which could genuinely be larger than some laptop screens depending on zoom or scaling.

Excellent game. I haven't finished it yet (though I got what I'm pretty sure is the hardest picture word) but the key strategy seems to be to pick a (hard) target word, sketch out some chains from there to some easier ones and then try to reach one of those.

Minor suggestions: better contrast in the tab screen for not-yet-founds, have all instructions in the supporting text (i.e. Tab and backspace too). Maybe allow hyperspacing to any word you've previously got to, although that's maybe a bit radical.

Personally I find the dance-ey style of graphics a bit tiring to look at, but that's just me.

EDIT: I'm finding that I tend to fixate too much on single-char replacements and not enough on anagrams. Curious whether that's just me.

4-letter word list helped me a lot to build paths to goal words. Also, I collected all words from code, so I can chase nearest goal.

PS.

Game works better in Firefox.

Late to the party, here is some code to solve the path between each word, just requires numpy and a txt file of 4 letter words "words.txt" separated by lines

    import numpy as np
    with open("words.txt") as f:
        words = f.read().splitlines()
        f.seek(0)
        chars = np.array(list(ord(c) for c in f.read() if c != '\n')).reshape((-1, 4))

    word_to_index = dict(zip(words, range(len(words))))

    char_flip = np.sum(chars[:, None, :] != chars[None, :, :], axis=2) == 1
    chars_sorted = np.sort(chars, axis=1)
    char_shuffle = np.all(chars_sorted[:, None, :] == chars_sorted[None, :, :], axis=2)

    adj = char_flip | char_shuffle
    np.fill_diagonal(adj, False)
    # import itertools

    def path_recursive(current, end, adj, path, depth):
        if depth