demystify 0.2.0

A constraint solving tool for explaining puzzles
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

use std::{sync::Arc, time::Duration};

use criterion::{Criterion, criterion_group, criterion_main};
use demystify::{
    problem::{
        planner::{PlannerConfig, PuzzlePlanner},
        solver::PuzzleSolver,
        util::test_utils::build_puzzleparse,
    },
    satcore::{get_solver_calls, reset_solver_calls},
    stats::{print_mus_stats, print_sat_stats, reset_mus_stats, reset_sat_stats},
};

fn bench_solve(c: &mut Criterion, name: &str, eprime: &str, param: &str, max_steps: Option<usize>) {
    // Build PuzzleParse once — calling Conjure is expensive, done outside the loop.
    let puz = Arc::new(build_puzzleparse(eprime, param));

    c.bench_function(name, |b| {
        b.iter_batched(
            || {
                reset_solver_calls();
                reset_mus_stats();
                reset_sat_stats();
                PuzzleSolver::new(Arc::clone(&puz)).expect("solver init failed")
            },
            |solver| {
                let config = PlannerConfig {
                    max_steps,
                    ..PlannerConfig::default()
                };
                let mut planner = PuzzlePlanner::new_with_config(solver, config);
                let result = planner.quick_solve();
                let calls = get_solver_calls();
                (result, calls)
            },
            criterion::BatchSize::SmallInput,
        );
    });

    // Print stats accumulated from the last benchmark iteration.
    eprintln!("\n--- MUS stats for {name} ---");
    print_mus_stats();
    eprintln!("\n--- SAT call stats for {name} ---");
    print_sat_stats();
}

fn binairo(c: &mut Criterion) {
    bench_solve(
        c,
        "binairo",
        "./tst/binairo.eprime",
        "./tst/binairo-1.param",
        None,
    );
}

fn minesweeper_wall(c: &mut Criterion) {
    bench_solve(
        c,
        "minesweeper_wall",
        "./tst/minesweeper.eprime",
        "./tst/minesweeperWall.param",
        None,
    );
}

fn little_sudoku(c: &mut Criterion) {
    bench_solve(
        c,
        "little_sudoku",
        "./tst/little-sudoku.eprime",
        "./tst/little-sudoku.param",
        None,
    );
}

const MIRACLE_EPRIME: &str = "../demystify-web/examples/eprime/miracle.eprime";
const MIRACLE_PARAM: &str = "../demystify-web/examples/eprime/miracle/original.param";

fn bench_miracle(
    c: &mut Criterion,
    name: &str,
    max_steps: Option<usize>,
    samples: usize,
    meas: Duration,
) {
    let puz = Arc::new(build_puzzleparse(MIRACLE_EPRIME, MIRACLE_PARAM));

    let mut group = c.benchmark_group(name);
    group.sample_size(samples);
    group.measurement_time(meas);

    group.bench_function("solve", |b| {
        b.iter_batched(
            || {
                reset_solver_calls();
                reset_mus_stats();
                reset_sat_stats();
                PuzzleSolver::new(Arc::clone(&puz)).expect("solver init failed")
            },
            |solver| {
                let config = PlannerConfig {
                    max_steps,
                    ..PlannerConfig::default()
                };
                let mut planner = PuzzlePlanner::new_with_config(solver, config);
                let result = planner.quick_solve();
                let calls = get_solver_calls();
                (result, calls)
            },
            criterion::BatchSize::SmallInput,
        );
    });

    group.finish();

    eprintln!("\n--- MUS stats for {name} ---");
    print_mus_stats();
    eprintln!("\n--- SAT call stats for {name} ---");
    print_sat_stats();
}

fn miracle_sudoku_02(c: &mut Criterion) {
    bench_miracle(
        c,
        "miracle_sudoku_02",
        Some(2),
        10,
        Duration::from_secs(120),
    );
}

criterion_group!(
    benches,
    binairo,
    minesweeper_wall,
    little_sudoku,
    miracle_sudoku_02
);
criterion_main!(benches);