Assume that you’re playing a game of hangman with me. But I’m a morally unscrupulous bastard and I cheat. Instead of thinking up the word before the game, I let your guesses determine which word I finally pick.
For example, if the game board was bea_ and you had two guesses left, there would be no way for you to win the game. If you guessed d and n, I would say my secret word is beat. If you guessed n and t, I would say it was bead etc.
Now, as a cheater, is there any way for me to guarantee that I win the game? Is there a set of moves I could make such that you could never win? Generalising, given a word list and a fixed number of wrong guesses allowed, what’s the algorithm to generate whether this word list favors the cheater or the guesser?