From a0e8861d1f1cce921350803bf0499941cb708dec Mon Sep 17 00:00:00 2001 From: Christian Heller Date: Fri, 1 Aug 2014 02:16:15 +0200 Subject: [PATCH] Server: Minor optimization of pathfinding algorithm. --- src/server/ai.c | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/src/server/ai.c b/src/server/ai.c index 31bc55c..b761c6b 100644 --- a/src/server/ai.c +++ b/src/server/ai.c @@ -97,7 +97,7 @@ static void dijkstra_map(uint16_t * score_map, uint16_t max_score) scores_still_changing = 0; for (pos = 0; pos < map_size; pos++) { - if ('.' == world.map.cells[pos] && score_map[pos] <= max_score) + if (score_map[pos] <= max_score) { get_neighbor_scores(score_map, pos, max_score, neighbors); min_neighbor = max_score; @@ -132,7 +132,11 @@ static char get_dir_to_nearest_enemy(struct Thing * t_origin) uint32_t i; for (i = 0; i < map_size; i++) { - score_map[i] = t_origin->fov_map[i] & VISIBLE ? max_score : UINT16_MAX; + score_map[i] = UINT16_MAX; + if (t_origin->fov_map[i] & VISIBLE && world.map.cells[i] == '.') + { + score_map[i] = max_score; + } } struct Thing * t = world.things; for (; t != NULL; t = t->next) -- 2.30.2