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
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188

//use std::collections::{BTreeSet, BTreeMap};
//use crate::cats::*;
//use crate::rules::*;
//use crate::data::{dir, Data};
use std::panic::RefUnwindSafe;
use crate::examples::*;
use crate::grid::*;
//use crate::shape::*;
use crate::cats::Colour;
use crate::cats::Transformation;
//use crate::cats::Transformation::NoTrans;

pub fn check_examples(ex: &Examples, func: &dyn Fn(&Example) -> bool) -> bool {
    for e in &ex.examples {
        if !func(e) {
            return false;
        }
    }

    true
}

pub fn check_input_grids(ex: &Examples, func: &dyn Fn(&Grid) -> bool) -> bool {
    for e in &ex.examples {
        if !func(&e.input.grid) {
            return false;
        }
    }

    true
}

pub fn check_output_grids(ex: &Examples, func: &dyn Fn(&Grid) -> bool) -> bool {
    for e in &ex.examples {
        if !func(&e.output.grid) {
            return false;
        }
    }

    true
}

/*
pub fn experiment_grid(ex: &Examples, len: usize, func: &dyn Fn(&Grid, &Grid, usize) -> Grid) -> Grid {
    let mut n = 0;

    for e in &ex.examples {
        let grid = &e.input.grid;
        let target = &e.output.grid;

        loop {
            if n >= len {
                return Grid::trivial();
            } else {
                if func(&grid, &target, n).equals(target) != Colour::Same {
                    n += 1;
                } else {
                    break;
                }
            }
        }
    }

    func(&ex.test.input.grid, &ex.examples[0].output.grid, n)
}
*/

pub fn experiment_grid(ex: &Examples, file: &str, experiment: usize, _trans: Transformation, func: &(dyn Fn(&Grid, &Grid, &mut usize) -> Grid + RefUnwindSafe)) -> Vec<Grid> {
    let mut n = usize::MAX;

    for (attempts, e) in ex.examples.iter().enumerate() {
        let grid = &e.input.grid;
        let target = &e.output.grid;

        if target.size() == 0 {
            return ex.tests.iter().map(|_| Grid::trivial()).collect::<Vec<_>>();
        }

        loop {
            if n == 0 {
                return ex.tests.iter().map(|_| Grid::trivial()).collect::<Vec<_>>();
            } else {
                let ans = func(grid, target, &mut n);
                /*
                let ans = if trans == NoTrans {
                    ans
                } else {
                    ans.inverse_transform(trans)
                };
                */
                if ans.equals(target) != Colour::Same {
                    if n == usize::MAX {
                        if attempts > 0 && (experiment < 100000 || attempts > 1) {
                            println!("{file} {experiment:<4}: {attempts} worked out of {}", ex.examples.len());
                        }
                        return ex.tests.iter().map(|_| Grid::trivial()).collect::<Vec<_>>();
                    }

                    n -= 1;
                } else {
                    break;
                }
            }
        }
    }

    // if experiments work then run tests
    ex.tests.iter().map(|test| {
        let ans = func(&test.input.grid, &ex.examples[0].output.grid, &mut n);

        /*
        if trans == NoTrans {
            ans
        } else {
            ans.inverse_transform(trans)
        }
        */
        ans
    })
    .collect()
}

pub fn experiment_example(ex: &Examples, file: &str, experiment: usize, _trans: Transformation, func: &(dyn Fn(&Example) -> Grid + RefUnwindSafe)) -> Vec<Grid> {
    for (attempts, e) in ex.examples.iter().enumerate() {
        //if attempts < 1 { continue; }
        let target = &e.output.grid;
        let ans = func(e);

        /*
        let ans = if trans == NoTrans {
            ans
        } else {
            ans.inverse_transform(trans)
        };
        */
//ans.show();

        if ans == Grid::trivial() || ans.equals(target) != Colour::Same {
            if attempts > 0 && (experiment < 100000 || attempts > 1) {
                println!("{file} {experiment:<4}: {attempts} worked out of {}", ex.examples.len());
            }
            return ex.tests.iter().map(|_| Grid::trivial()).collect::<Vec<_>>();
        }
    }
    
    // if experiments work then run tests
    ex.tests.iter().map(|test| {
        let ans = func(test);

        /*
        if trans == NoTrans {
            ans
        } else {
            ans.inverse_transform(trans)
        }
        */
        ans
    })
    .collect()
}

pub fn experiment_colours(ex: &Examples, func: &(dyn Fn(&Example, Colour) -> Grid + RefUnwindSafe)) -> Vec<Grid> {
    const COLOURS: &[Colour]  = Colour::base_colours();

    'outer:
    for colour in COLOURS {
        for e in ex.examples.iter() {
            let target = &e.output.grid;
            let ans = func(e, *colour);

            if ans == Grid::trivial() || ans.equals(target) != Colour::Same {
                continue 'outer;
            }
        }
        
        // if experiments work then run tests
        let ans = ex.tests.iter().map(|test| {
            let ans = func(test, *colour);

            ans
        })
        .collect();

        return ans;
    }

    ex.tests.iter().map(|_| Grid::trivial()).collect::<Vec<_>>()
}