Chaff algorithm
From Wikipedia, the free encyclopedia
This article does not cite any references or sources. (March 2008) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. |
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. zChaff was originally written by Dr. Lintao Zhang, now at Microsoft Research, hence the āzā. It is now maintained by researchers at Princeton University and available for download as both source code and binaries on Linux. zChaff is free for non-commercial use.