Programming, Binary Decision Diagrams, Computer Science, Boolean.
terminal. Equivalence checking — Checking if two boolean formulas are equivalent is easy with BDDs because they are a canonical representation. If the BDDs are the same, the formulas are the same. An Example: Sudoku Unsolved Sudoku puzzle. From https://en.wikipedia.org/wiki/Sudoku. BDDs can be used