public class ZDDCSPQueens extends ZDDCSP implements Queens
N Queen with Z-BDDs and the CSP procedures. The implementation comes directly from a famous Z-BDD paper [Okuno's ]. It will probably go much faster if we can figure out how to make the exclude-operator native [current version makes calls to restrict and diff]...
CACHE_NOSUPSET, CACHE_RESTRICT, csp_cacheunate_cachedead_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 |
|---|
ZDDCSPQueens(int n) |
| Modifier and Type | Method and Description |
|---|---|
long |
getMemory() |
int |
getN() |
boolean[] |
getOneSolution() |
long |
getTime() |
static void |
internal_test()
testbench.
|
static void |
main(String[] args) |
double |
numberOfSolutions() |
cleanup, exclude, getMemoryUsage, post_removal_callbak, restrict, showStatsaddDebugger, base, change, count, createVar, cube, cube, cube, cubes_intersect, cubes_union, diff, diffTo, empty, emptyIn, follow_high, follow_low, intersect, mk, nodeCount, print, printCubes, printDot, printSet, satOne, setNodeNames, single, subset0, subset1, subsets, union, unionTo, universeadd, 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 double numberOfSolutions()
numberOfSolutions in interface Queenspublic long 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.