arc-agi 0.1.6

ARC-AGI submission
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

use pathfinding::prelude::Matrix;
use crate::cats::Colour;
use crate::cell::Cell;

// Expensive when applied to every cell
pub fn surround_cnt(m: &Matrix<Cell>, r: usize, c: usize, colour: Colour) -> (usize, bool) {
    let mut cnt = 0;
    let rows = m.rows - 1;
    let cols = m.columns - 1;
    let mut edge = true;

    if r > 0 && r < rows && c > 0 && c < cols {
        if m[(r-1,c)].colour == colour { cnt += 1 };
        if m[(r,c-1)].colour == colour { cnt += 1 };
        if m[(r-1,c-1)].colour == colour { cnt += 1 };
        if m[(r+1,c)].colour == colour { cnt += 1 };
        if m[(r,c+1)].colour == colour { cnt += 1 };
        if m[(r+1,c+1)].colour == colour { cnt += 1 };
        if m[(r+1,c-1)].colour == colour { cnt += 1 };
        if m[(r-1,c+1)].colour == colour { cnt += 1 };
        edge = false;
    } else if r == 0 && c == 0 {
        cnt += 5;
        if r == rows || m[(r+1,c)].colour == colour { cnt += 1 };
        if c == cols || m[(r,c+1)].colour == colour { cnt += 1 };
        if r == rows || c == cols || m[(r+1,c+1)].colour == colour { cnt += 1 };
    } else if r == 0 {
        cnt += 3;
        if m[(r,c-1)].colour == colour { cnt += 1 };
        if r == rows || m[(r+1,c)].colour == colour { cnt += 1 };
        if c == cols || m[(r,c+1)].colour == colour { cnt += 1 };
        if r == rows || c == cols || m[(r+1,c+1)].colour == colour { cnt += 1 };
        if r == rows || m[(r+1,c-1)].colour == colour { cnt += 1 };
    } else if c == 0 {
        cnt += 3;
        if m[(r-1,c)].colour == colour { cnt += 1 };
        if r == rows || m[(r+1,c)].colour == colour { cnt += 1 };
        if c == cols || m[(r,c+1)].colour == colour { cnt += 1 };
        if r == rows || c == cols || m[(r+1,c+1)].colour == colour { cnt += 1 };
        if c == cols || m[(r-1,c+1)].colour == colour { cnt += 1 };
    } else if r == rows && c == cols {
        cnt += 5;
        if m[(r-1,c)].colour == colour { cnt += 1 };
        if m[(r,c-1)].colour == colour { cnt += 1 };
        if m[(r-1,c-1)].colour == colour { cnt += 1 };
    } else if r == rows {
        cnt += 3;
        if m[(r-1,c)].colour == colour { cnt += 1 };
        if m[(r,c-1)].colour == colour { cnt += 1 };
        if m[(r-1,c-1)].colour == colour { cnt += 1 };
        if m[(r,c+1)].colour == colour { cnt += 1 };
        if m[(r-1,c+1)].colour == colour { cnt += 1 };
    } else if c == cols {
        cnt += 3;
        if m[(r-1,c)].colour == colour { cnt += 1 };
        if m[(r,c-1)].colour == colour { cnt += 1 };
        if m[(r-1,c-1)].colour == colour { cnt += 1 };
        if m[(r+1,c)].colour == colour { cnt += 1 };
        if m[(r+1,c-1)].colour == colour { cnt += 1 };
    }

    (cnt, edge)
}