qap -DCONSTRAINT_TEMPS -DDOMAIN_BOUNDS A --label --first-fail (N > 16 ?) {,--label{, --first-fail, --most-constrained, --most-connected}} (otherwise) B --label --first-fail costas -DCONSTRAINT_TEMPS -DDOMAIN_BOUNDS --label --most-constrained --split-even (first solution) N <= DOMAIN_BITS / 2 queens -DDOMAIN_BOUNDS ??? [not ism] --first-fail magic-square -DCONSTRAINT_TEMPS (-DDISABLE_ENTAILED) (-DDOMAIN_BOUNDS incurs a < 5% penalty) --first-fail (--count-solutions, --gecode, N > 5) graphs -DUSE_MATCHING -DCONSTRAINT_TEMPS (-DDOMAIN_BOUNDS incurs a < 2% penalty) --most-connected (--first-fail the second best choice) partition -DCONSTRAINT_TEMPS -DDOMAIN_BOUNDS (-DDISABLE_ENTAILED) --first-fail --first-var (--count-solutions or failure) (--most-constrained second best choice with --count-solutions) (--most-connected third best choice with --count-solutions) golomb -DDOMAIN_BOUNDS (-DCONSTRAINT_TEMPS -DDISABLE_ENTAILED [cri-lima]) --label{, --most-connected, --most-constrained} --split-eager (--split-even is generally slower, but more regular) langford [bicho] -DDOMAIN_BOUNDS -DCONSTRAINT_TEMPS -DDISABLE_ENTAILED -DDOMAIN_BOUNDS (next best) -DINLINE_DOMAINS -DCONSTRAINT_TEMPS (third best) [ism] -DINLINE_DOMAINS -DINLINE_DOMAINS -DCONSTRAINT_TEMPS -DDISABLE_ENTAILED (next best) -DINLINE_DOMAINS -DCONSTRAINT_TEMPS (third best) -DDOMAIN_BOUNDS (fourth best) [cri-lima] -DINLINE_DOMAINS -DCONSTRAINT_TEMPS -DDISABLE_ENTAILED -DINLINE_DOMAINS (next best) -DINLINE_DOMAINS -DCONSTRAINT_TEMPS (third best) -DDOMAIN_BOUNDS -DCONSTRAINT_TEMPS -DDISABLE_ENTAILED (fourth best) -DDOMAIN_BOUNDS (fifth best) --first-fail --val-max (--count-solutions or failure) --size-degree --val-max (first solution, not always but when it works, the effect is dramatic) --split-eager golfers -D? --label --val-max? bibd -D? --val-max?