Chaff algorithm
From Wikipedia, the free encyclopedia
Chaff is an algorithm for solving instances of the boolean satisfiability problem in programming. It was designed by researchers at Princeton University, USA. The algorithm is an instance of the DPLL algorithm with a number of enhancements for efficient implementation.
[edit] Implementations
Some available implementations of the algorithm in software are mChaff and zChaff, the latter one being the most widely known and used. Chaff aims at optimizing various aspects of the DPLL algorithm.
