# Factories¶

dwavebinarycsp currently provides factories for constraints representing Boolean gates and satisfiability problems and CSPs for circuits and satisfiability problems.

## Constraints¶

### Gates¶

 gates.and_gate(variables[, vartype, name]) AND gate. gates.or_gate(variables[, vartype, name]) OR gate. gates.xor_gate(variables[, vartype, name]) XOR gate. gates.halfadder_gate(variables[, vartype, name]) Half adder. gates.fulladder_gate(variables[, vartype, name]) Full adder.

### Satisfiability Problems¶

 sat.sat2in4(pos[, neg, vartype, name]) Two-in-four (2-in-4) satisfiability.

## CSPs¶

 circuits.multiplication_circuit(nbit[, vartype]) Multiplication circuit constraint satisfaction problem. sat.random_2in4sat(num_variables, num_clauses) Random two-in-four (2-in-4) constraint satisfaction problem. sat.random_xorsat(num_variables, num_clauses) Random XOR constraint satisfaction problem.