Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Solving Wordle with Z3. Parent comment
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.
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.