+ return 0;
+ }
+ struct ThingInMemory * tm = t_eye->t_mem;
+ for (; tm; tm = tm->next)
+ {
+ if ( ' ' != t_eye->mem_map[tm->pos.y * world.map.length + tm->pos.x]
+ && get_thing_type(tm->type)->consumable)
+ {
+ score_map[tm->pos.y * world.map.length + tm->pos.x] = 0;
+ }
+ }
+ return 1;
+}
+
+
+
+static uint8_t score_map_filter_search(uint8_t filter, uint16_t * score_map,
+ struct Thing * t_eye)
+{
+ if (!(('0' < filter && '9' >= filter) || ' ' == filter))
+ {
+ return 0;
+ }
+ uint32_t i;
+ for (i = 0; i < (uint32_t) (world.map.length * world.map.length); i++)
+ {
+ score_map[i] = filter == t_eye->mem_depth_map[i] ? 0 : score_map[i];
+ }
+ return 1;
+}
+
+
+
+static void init_score_map(char filter, uint16_t * score_map, uint32_t map_size,
+ struct Thing * t_eye)
+{
+ uint32_t i;
+ for (i = 0; i < map_size; i++)
+ {
+ score_map[i] = UINT16_MAX;
+ if ('.' == t_eye->mem_map[i])
+ {
+ score_map[i] = UINT16_MAX-1;
+ }
+ }
+ if ( score_map_filter_attack(filter, score_map, t_eye)
+ || score_map_filter_flee(filter, score_map, t_eye)
+ || score_map_filter_consume(filter, score_map, t_eye)
+ || score_map_filter_search(filter, score_map, t_eye))
+ {
+ }
+}
+
+
+static char rand_target_dir(char * dirs, uint16_t cmp, uint16_t * targets)
+{
+ char candidates[N_DIRS];
+ uint8_t n_candidates = 0;
+ uint8_t i;
+ for (i = 0; i < N_DIRS; i++)
+ {
+ if (cmp == targets[i])
+ {
+ candidates[n_candidates] = dirs[i];
+ n_candidates++;
+ }
+ }
+ return n_candidates ? candidates[rrand() % n_candidates] : 0;
+}
+
+
+
+static char get_dir_from_neighbors(char filter, struct Thing * t_eye,
+ uint16_t * score_map)
+{
+ char dir_to_nearest_target = 0;
+ uint16_t pos_i = (t_eye->pos.y * world.map.length) + t_eye->pos.x;
+ char * dirs = "edcxsw"; /* get_neighbor_scores()'s clockwise dir order. */
+ uint16_t neighbors[N_DIRS];
+ get_neighbor_scores(score_map, pos_i, UINT16_MAX, neighbors, 'f'==filter);
+ uint16_t minmax_start = 'f' == filter ? 0 : UINT16_MAX-1;
+ uint16_t minmax_neighbor = minmax_start;
+ uint8_t i;
+ for (i = 0; i < N_DIRS; i++)
+ {
+ if ( ( 'f' == filter && score_map[pos_i] < neighbors[i]
+ && minmax_neighbor < neighbors[i] && UINT16_MAX != neighbors[i])
+ || ('f' != filter && minmax_neighbor > neighbors[i]))
+ {
+ minmax_neighbor = neighbors[i];
+ }
+ }
+ if (minmax_neighbor != minmax_start)
+ {
+ dir_to_nearest_target = rand_target_dir(dirs,minmax_neighbor,neighbors);
+ }
+ if ('f' == filter)
+ {
+ if (!dir_to_nearest_target)