Hacker News Reader

Yes, it's called Mastermind [0]. Just fewer colors than letters.

[0] https://en.wikipedia.org/wiki/Mastermind_(board_game)

And for the nerds: https://en.wikipedia.org/wiki/Mastermind_(board_game)#Worst_... (Knuth)

and In November 2004, Michiel de Bondt proved that solving a Mastermind board is an NP-complete problem when played with n pegs per row and two colors, by showing how to represent any one-in-three 3SAT problem in it.

I'd argue it's harder though as colors can form any sequence - they don't have to form legal words.

I'd argue that at the same time it is easier because you do not need to find valid colour sequences (in wordle you can only enter actual words to explore the solution). I wonder if the result is easier or harder overall?

Reply on news.ycombinator.com