number-loom 0.5.0

Multipurpose GUI and CLI tool for constructing nonograms
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



use priority_queue::PriorityQueue;


#[derive(PartialEq, Eq, Hash, Debug, Clone)]
struct HypoCoord<G: GridKind> {
    guesses: Vec<(G::Coord, Color)>
}


struct BtSearchState<G: GridKind> {
    /// Need interior mutability so the parent references can be `&` 
    knowledge: RefCell<solveState>,

    depth: u8
}

pub fn backtrack_solve<C: Clue, K: GridKind>(
    puzzle: &Puzzle<C, K>,
    options: &SolveOptions,
    grid: &mut PartialSolution,
) -> anyhow::Result<Report> {

    let mut grid = vec![Cell::new(&puzzle.palette); puzzle.geometry.cell_count()];
    let mut line_cache: LineCache<C> = LineCache::new();

    let mut ctx = SolveContext::new(puzzle, line_cache, options);
    let mut state = SolveState::new(&mut ctx, std::mem::take(grid));

    let outcome = state.run(&mut ctx);
    ctx.progress.finish_and_clear();

    let report = outcome.map(|_| state.report(puzzle));
    // Hand the caller's grid back even on failure, so it still sees how far we got.
    *grid = std::mem::take(&mut state.grid);
    report
}