Skip to main content

Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TagsGame Engines
(+1)

you beat me to it! I've got a python script in the works to calculate the smallest possible winning path that goes via all picture words

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.

(1 edit)

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