Jump to content

Chaff algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 212.152.133.244 (talk) at 21:10, 9 August 2007 (deleted unnecessary sentence). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Implementations

Some available implementations of the algorithm in software are mChaff and zChaff, the latter one being the most widely known and used.