Did you make a script? If you did I'm interested to know how you solved it. This problem seems to be a version of the travelling salesman problem which means that brute-forcing a solution would take too long.
yeah brute forcing would take a while, I'll never find the true best solution. But I've got a pretty good one that visits only 182 unique words to go via the 105 picture words (so it only touches 77 non-picture words), it uses a lot of undos which don't require you to visit any new words
