2 ms·
And for the nerds: https://en.wikipedia.org/wiki/Mastermind_(board_game)#Worst_case:_Five-guess_algorithm https://en.wikipedia.org/wiki/Mastermind_(board_game)#
by dekhn 5y ago
And for the nerds: https://en.wikipedia.org/wiki/Mastermind_(board_game)#Worst_case:_Five-guess_algorithm 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.