Boolean satisfiability problem
Mathematicians of Dutch university (PH Utomo and RH Makarim) proposed three different approaches to solve binary puzzles: using backtrack-based search, SAT solvers, and Gröbner bases algorithms. The last two approaches reduce the problem of solving a binary puzzle to a Boolean satisfiability problem and solving systems of polynomial equations over the binary field.