Generate permutaitons and bitmasks

1 files changed, 10 insertions, 2 deletions

diff --git a/src/main.rs b/src/main.rs
index a59f553..178664f 100755
--- a/src/main.rs
+++ b/src/main.rs
@@ -5,8 +5,16 @@ mod structs;
 #[macro_use]
 pub extern crate lazy_static;
 
+use crate::solver::{Solver, IteratorSolver};
+
 pub static N: u32 = 8;
 fn main() {
-    let mut solver = solvers::intuitive::NormalSolver::new(N);
-    solver.solve();
+    //let mut solver = solvers::intuitive::NormalSolver::new(N);
+    //solver.solve();
+    
+    let mut solver = solvers::gpusolver::GpuSolver::new(N);
+    println!("solver: {:?}", solver);
+    for (i, solution) in solver.solve().enumerate() {
+        println!("{}: {:?}", i, solution);
+    }
 }