Example scripts (models)
Detailed Description
All scripts are compiled into simple standalone programs.These programs understand the following options given on the commandline:
-mode (solution, time, stat)solution: print solutions.time: measure time.timenogc: measure time while trying to force garbage collection between rounds.
-naive,-smart: if there is a naive and a smart model of the problem, select which to use-gui,-nogui: select wheter to use the graphical interactive search tool or just text-based output of the search-results.-solutions: give the maximum number of solutions after which the search stops. 0 means all solutions.-fails: give the maximum number of failures after which the search stops. -1 means no limit.-time: give the maximum time allowed after which the search stops. -1 means no limit.-icl (def, val, bnd, dom): give the consistency level of integer constraints such asdistinct.-print (boolean): wheter to print the solutions or not.-bab (boolean): wheter to use optimizing search or not.-c_d,-a_c: copying and adaptive recomputation distance to be used by the search engine.-samples,-iterations: how many samples and iterations per sample to compute in time mode.-help: print usage information and default values for all options.
Many scripts can be given the problem size as an extra argument.
Classes | |
| class | examples.Money |
| Script for the classic SEND+MORE=MONEY puzzle. More... | |
| class | examples.Options |
| Class implementing option parsing for the example scripts. More... | |
| class | examples.Photo |
| Script for placing people on a photo. More... | |
| class | examples.Queens |
| Script for the n-Queens puzzle. More... | |
| class | examples.QueensJavaPropagator |
| Script for the n-Queens puzzle. More... | |
| class | examples.Steiner |
| Script for computing steiner triples. More... | |