In this talk I will introduce the libarary of BDD and ZDD. BDDs (Binary Decision Diagrams) are graph-based representations of Boolean functions, now widely used in system design and verification. Zero-suppressed BDDs (ZDDs) are a special type of BDDs that are suitable for handling large-scale sets of combinations. Using BDDs and ZDDs, I will show you the solution for n-Queen problem and the some of Datamining problems.