deus-nqueens 0.3.0

NQueens Problem Solver
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

use crate::NQueens;
use rayon::iter::{IntoParallelIterator, ParallelIterator};
use wolfram_library_link::{
    export,
    expr::{Expr, Number, Symbol},
};

fn failed() -> Expr {
    Expr::symbol(Symbol::new("System`$Failed"))
}

#[export(wstp)]
fn guess_number_ffi(args: Vec<Expr>) -> Expr {
    match args.as_slice() {
        [a, b, c] => {
            let min = match a.try_number().unwrap() {
                Number::Integer(i) if i >= 0 => i as usize,
                _ => return failed(),
            };
            let max = match b.try_number().unwrap() {
                Number::Integer(i) if i as usize > min => i as usize,
                _ => return failed(),
            };
            let times = match c.try_number().unwrap() {
                Number::Integer(i) if i > 0 => i as usize,
                _ => return failed(),
            };
            Expr::list(guess_number(min, max, times))
        }
        _ => failed(),
    }
}

fn guess_number_dichotomy(min: usize, max: usize, times: usize) -> Vec<Expr> {
    (0..times)
        .into_par_iter()
        .map(|_| {
            let mut game = NQueens::new(min, max);
            let a = game.dichotomy();
            let b = game.golden_divide();
            let c = game.random_select();
            Expr::list(vec![Expr::from(a as i32), Expr::from(b as i32), Expr::from(c as i32)])
        })
        .collect()
}

#[test]
fn test() {}