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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
extern crate std;

use board::{GoBoard, Team};
use board::Tile;
use ia;

pub type HeuristicFn = fn(board: &GoBoard, team: Team) -> i32;

const WIN: i32 = ia::INFINITE - 100;

fn check_index(board: &GoBoard, x: i32, y: i32) -> bool {
    if x < 0 || y < 0 {
        return false;
    }
    if x >= board.get_size() as i32 || y >= board.get_size() as i32 {
        return false;
    }
    true
}

/// dx and dy must equal 1 or -1
fn nb_in_line(board: &GoBoard,
              x: i32, y: i32,
              dx: i32, dy: i32,
              team: Tile)
              -> i32 {
    let mut ttl = 1;
    let mut free_extrems = 0;
    let mut blank = 0;

    let mut nx = x + dx;
    let mut ny = y + dy;
    while check_index(board, nx, ny) &&
          board.get((nx as usize, ny as usize)) == team {
        nx += dx;
        ny += dy;
        ttl += 1;
    }
    if check_index(board, nx, ny) &&
            board.get((nx as usize, ny as usize)) != team.ennemy() {
        free_extrems += 1;
        while check_index(board, nx, ny) &&
              board.get((nx as usize, ny as usize)) == Tile::FREE &&
              blank + ttl < 6 {
            nx += dx;
            ny += dy;
            blank += 1;
        }
    }

    nx = x - dx;
    ny = y - dy;
    while check_index(board, nx, ny) &&
          board.get((nx as usize, ny as usize)) == team {
        nx -= dx;
        ny -= dy;
        ttl += 1;
    }
    if check_index(board, nx, ny) &&
            board.get((nx as usize, ny as usize)) != team.ennemy() {
        free_extrems += 1;
        while check_index(board, nx, ny) &&
              board.get((nx as usize, ny as usize)) == Tile::FREE &&
              blank + ttl < 6 {
            nx -= dx;
            ny -= dy;
            blank += 1;
        }
    }

    if blank + ttl < 5 { // if can't expand to victory line, this line is useless
        0
    } else if ttl >= 5 {
        WIN + (ttl - 5) * free_extrems
    } else if free_extrems == 2 && ttl >= 4 {
        WIN - 1
    } else if ttl > 0 {
        ttl * free_extrems
    } else {
        0
    }
}

fn tile_value(board: &GoBoard,
              x: i32,
              y: i32,
              team: Tile)
              -> i32 {
    let mut ttl_tile = 0;
    let score_tile = nb_in_line(board, x, y, 1, 1, team);
    if score_tile >= WIN - 10 {
        return WIN;
    }
    ttl_tile += score_tile;
    let score_tile = nb_in_line(board, x, y, 0, 1, team);
    if score_tile >= WIN - 10 {
        return WIN;
    }
    ttl_tile += score_tile;
    let score_tile = nb_in_line(board, x, y, 1, 0, team);
    if score_tile >= WIN - 10 {
        return WIN;
    }
    ttl_tile += score_tile;
    let score_tile = nb_in_line(board, x, y, 1, -1, team);
    if score_tile >= WIN - 10 {
        return WIN;
    }
    ttl_tile += score_tile;
    ttl_tile
}

pub fn heuristic(board: &GoBoard, team: Team) -> i32 {
    let mut player_score = team.captured() as i32 * team.captured() as i32;
    let mut enemy_score = 0;
    for x in 0..board.get_size() {
        for y in 0..board.get_size() {
            match board.get((x, y)) {
                Tile::FREE => {},
                t if team.get_tile() == t => {
                    let tile_score = tile_value(board, x as i32, y as i32, team.get_tile());
                    if tile_score >= WIN - 10 {
                        return tile_score;
                    } else {
                        player_score += tile_score;
                    }
                },
                t if team.get_ennemy_tile() == t => {
                    let tile_score = tile_value(board, x as i32, y as i32, team.get_ennemy_tile());
                    if tile_score >= WIN - 10 {
                        return tile_score;
                    }
                    let tile_score = tile_value(board, x as i32, y as i32, team.get_ennemy_tile());
                    if tile_score == WIN {
                        return ia::NINFINITE;
                    } else {
                        enemy_score += tile_score;
                    }
                },
                _ => {}
            }
        }
    }
    player_score - enemy_score
}

/// Heuristic for white is greater than black.
#[cfg(test)]
fn test_one(s: &str) {
    let board = GoBoard::parse_with_size(&s.to_string());
    let (team_b, team_w) = Team::new_teams();
    println!("Test\n{}", board);
    let white = heuristic(&board, team_w);
    let black = heuristic(&board, team_b);
    println!("Is white {} > black {}", white, black);
    assert!(white >black);
}

/*#[test]
fn test_heuristic() {
    let s = r#"19
W . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . W
        "#;
    test_one(s);

    let s = r#"19
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . . . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . . . . . . . . .
. . . . . . . . . . . B . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . B . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
        "#;
    test_one(s);

    let s = r#"19
. . . . . . . . . B . . . . . . . . .
. . . . . . . . . B . . . . . . . . .
. . . . . . . . . B . . . . . . . . .
. . . . B . . . . B . . . . . . . . .
. . . . B . . . . . . . . . . . . . .
. . . . B . . . . . . . . . . . . . .
. . . . B . . . . . . B . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . . . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . . . B . . . . . . .
. . . . . . . . . . . B . . . . . . .
. . B B B B . . . . . B . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
        "#;
    test_one(s);

    let s = r#"19
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . B . . . . . . . . .
. . . . . . . . . . . W . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . W . B . . . . . . .
. . . . . . . . . B . W . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
        "#;
    test_one(s);
}
*/