timecat 1.52.0

A NNUE-based chess engine that implements the Negamax algorithm and can be integrated into any project as a library. It features move generation, advanced position evaluation through NNUE, and move searching capabilities.
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

#[test]
fn test_boolean_and_behavior() {
    #[derive(Default)]
    struct Counter {
        count: usize,
    }

    impl Counter {
        fn increase_count_and_return_true(&mut self) -> bool {
            self.count += 1;
            true
        }
    }

    let mut counter1 = Counter::default();
    let mut counter2 = Counter::default();
    let mut n1 = 0;
    let mut n2 = 0;
    for i in 0..10 {
        if i % 2 == 0 && counter1.increase_count_and_return_true() {
            n1 += 1;
        }
        if counter2.increase_count_and_return_true() && i % 2 == 0 {
            n2 += 1;
        }
    }
    assert_eq!(n1, 5);
    assert_eq!(counter1.count, 5);
    assert_eq!(n2, 5);
    assert_eq!(counter2.count, 10);
}

#[test]
fn test_boolean_or_behavior() {
    #[derive(Default)]
    struct Counter {
        count: usize,
    }

    impl Counter {
        fn increase_count_and_return_false(&mut self) -> bool {
            self.count += 1;
            false
        }
    }

    let mut counter1 = Counter::default();
    let mut counter2 = Counter::default();
    let mut n1 = 0;
    let mut n2 = 0;
    for i in 0..10 {
        if i % 2 == 0 || counter1.increase_count_and_return_false() {
            n1 += 1;
        }
        if counter2.increase_count_and_return_false() || i % 2 == 0 {
            n2 += 1;
        }
    }
    assert_eq!(n1, 5);
    assert_eq!(counter1.count, 5);
    assert_eq!(n2, 5);
    assert_eq!(counter2.count, 10);
}