domino-lib 2.0.0

Domino library, create sequences and puzzles, solve and validate them in rust
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


// pub mod benches;

mod tests {

  use domino_lib::{
      classify_puzzle, generate_puzzle, solve_puzzle, validate_puzzle, ComplexityClass,
  };

  fn test_suite() -> Vec<usize> {
      // todo!("Add more lengths to test suite");
      return vec![3, 6, 9];
  }

  #[test]
  fn test_generate() {
      test_suite().into_iter().for_each(|n| {
        (1..=3).for_each(|c| {
          let puzzle = generate_puzzle(n, c);
          if n % 2 == 0 {
              assert_eq!(puzzle.0.len(), (n + 1) * (n + 2) / 2);
          } else {
              assert_eq!(puzzle.0.len(), (n + 1) * (n + 1) / 2);
          }
        });
      });
  }

  #[test]
  fn test_solve() {
      test_suite().into_iter().for_each(|n| {
        (1..=3).for_each(|c| {
          let puzzle = generate_puzzle(n, c);
          println!("Puzzle: {puzzle:?}");
          let solution = solve_puzzle(&puzzle).unwrap();
          println!("Solution: {solution:?}");
          assert_eq!(solution.len(), puzzle.0.len());
      });
    });
  }

  #[test]
  fn test_validate() {
      test_suite().into_iter().for_each(|n| {
        (1..=3).for_each(|c| {
          // For each length a puzzle with a single tile missing is always valid
          let puzzle = generate_puzzle(n, c);
          println!("Puzzle: {}",serde_json::to_string(&puzzle).unwrap());
          let solution = solve_puzzle(&puzzle).unwrap();
          let result = validate_puzzle(&puzzle, &solution);
          assert!(result.is_ok());
      });
    });
  }

  #[test]
  fn test_classify() {
      test_suite().into_iter().for_each(|n| {
          (1..=3)
              .into_iter()
              .map(|c| ComplexityClass::new(c).unwrap())
              .for_each(|expected_complexity| {
                  let puzzle = generate_puzzle(n, expected_complexity.0);
                  println!("Puzzle: {puzzle:?}");
                  let computed_complexity =
                      classify_puzzle(&puzzle).expect("Failed to classify puzzle: {puzzle:?}");
                  assert_eq!(computed_complexity, expected_complexity);
              })
      });
  }

  #[test]
  fn test_all() {
      test_suite().into_iter().for_each(|n| {
          (1..=3)
              .into_iter()
              .map(|c| ComplexityClass::new(c).unwrap())
              .for_each(|expected_complexity| {
                  let puzzle = generate_puzzle(n, expected_complexity.0);
                  let solution = solve_puzzle(&puzzle).unwrap();
                  let _ = validate_puzzle(&puzzle, &solution)
                      .map(|_solution| {
                          let computed_complexity = classify_puzzle(&puzzle)
                              .expect("Failed to classify puzzle: {puzzle:?}");
                          assert_eq!(computed_complexity, expected_complexity);
                      });
              });
      });
  }

}