public class BDDQueens extends BDD implements Queens
The N Queens on a N * N chessboard... we have borrowed this from JavaBDD, to see how much of the [lack of] speed depends on Java... Note that this problem can be solved far faster with a more intelligent use of BDDs. [e-mail Arash and ask for an explanation, because none of us knows why he claims such a thing...]
CACHE_AND, CACHE_BIIMP, CACHE_EXISTS, CACHE_FORALL, CACHE_IMP, CACHE_NAND, CACHE_NOR, CACHE_OR, CACHE_RESTRICT, CACHE_XOR, ite_cache, last_sat_vars, nodeNames, not_cache, num_vars, oneSat_buffer, op_cache, quant_cache, quant_conj, quant_cube, quant_id, relprod_cache, replace_cache, restrict_careset, sat_cache, sign_vec, varset_last, varset_vecdead_nodes, ht_chain, mark_stack, NODE_MARK, NODE_UNMARK, nodesminfree, stat_gc_count, stat_gc_freed, stat_gc_time, stat_grow_time, stat_lookup_count, stat_notify_time, stat_nt_grow, table_size, work_stack, work_stack_tos| Constructor and Description |
|---|
BDDQueens(int N) |
| Modifier and Type | Method and Description |
|---|---|
double |
getMemory() |
int |
getN() |
boolean[] |
getOneSolution() |
long |
getTime() |
static void |
internal_test()
testbench.
|
static void |
main(String[] args) |
double |
numberOfSolutions() |
void |
showOneSolution() |
and, andTo, biimp, cleanup, createPermutation, createVar, cube, cube, exists, forall, getMemoryUsage, getOne, getZero, imp, isVariable, ite, member, minterm, minterm, mk, nand, nodeCount, nor, not, numberOfVariables, oneSat_rec, oneSat, oneSat, or, orTo, post_removal_callbak, print, printCubes, printDot, printSet, quasiReducedNodeCount, relProd, replace, restrict, satCount_rec, satCount, setNodeNames, showStats, simplify, support, xoradd, addDebugger, check_all_nodes, check_node, countRootNodes, deref, enableStackMarking, gc, getHigh, getLow, getRef, getVar, getVarUnmasked, grow, invalidate, isNodeMarked, isValid, mark_node, mark_tree, match_table, ref, saturate, setAll, setAll, show_table_all, show_table, show_tuple, signal_removed, tree_depth_changed, unmark_node, unmark_tree, update_grow_parameterspublic void showOneSolution()
public double numberOfSolutions()
numberOfSolutions in interface Queenspublic double getMemory()
public boolean[] getOneSolution()
getOneSolution in interface Queenspublic static void main(String[] args)
public static void internal_test()
This file is a part of the JDD package, a native Java Binary Decision Diagram Library.