3 ms·
Norvig's statements are mathematically proven.
by jibalt 5y ago
Norvig's statements are mathematically proven.
- CamperBob2 5y agoWith different goals. I try to minimize the number of required guesses, while he is trying to maximize the odds of a 2-guess win. To do that, he deliberately avoids guessing letters that would fit the more-common cases where a 2-guess win is extremely unlikely. In other words, Norvig's approach requires you to guess letters that aren't that likely to appear at all. He will get more 2-guess wins, but I will do better in the long run.
- jibalt 5y ago"while he is trying to maximize the odds of a 2-guess win" You seem not to have read past the first few lines of the article.
- deleted 5y ago[deleted]
- CamperBob2 5y agoMaybe I misinterpreted what I did read. Is he saying that early-stage guesses that contain uncommon letters is the optimal strategy? If so, I'll go back and try to understand the specific reasoning, because that doesn't sound right.