+ return score_map[pos];
+}
+
+
+
+static void get_neighbor_scores(uint16_t * score_map, uint16_t pos_i,
+ uint16_t kill_score, uint16_t * neighbors,
+ uint8_t check_inhabitants)
+{
+ uint32_t map_size = world.map.length * world.map.length;
+ uint8_t open_north = pos_i >= world.map.length;
+ uint8_t open_east = pos_i + 1 % world.map.length;
+ uint8_t open_south = pos_i + world.map.length < map_size;
+ uint8_t open_west = pos_i % world.map.length;
+ uint8_t is_indented = (pos_i / world.map.length) % 2;
+ uint8_t open_diag_west = is_indented || open_west;
+ uint8_t open_diag_east = !is_indented || open_east;
+ neighbors[0] = !(open_north && open_diag_east) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i - world.map.length + is_indented);
+ neighbors[1] = !(open_east) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i + 1);
+ neighbors[2] = !(open_south && open_diag_east) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i + world.map.length + is_indented);
+ neighbors[3] = !(open_south && open_diag_west) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i + world.map.length - !is_indented);
+ neighbors[4] = !(open_west) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i - 1);
+ neighbors[5] = !(open_north && open_diag_west) ? kill_score :
+ set_neighbor_val(score_map, check_inhabitants, kill_score,
+ pos_i - world.map.length - !is_indented);
+}
+
+
+
+static void dijkstra_map(uint16_t * score_map, uint16_t max_score)
+{
+ uint32_t map_size = world.map.length * world.map.length;
+ uint32_t pos;
+ uint16_t i_scans, neighbors[N_DIRS], min_neighbor;
+ uint8_t scores_still_changing = 1;
+ uint8_t i_dirs;
+ for (i_scans = 0; scores_still_changing; i_scans++)