News for hackers. Stuff that matters.
Re:Solving Wordle with Z3 by dekhn on Tuesday January 11, 2022 @10:05AM (#29892248)
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.

There are no comments on this comment yet.