X-Git-Url: https://plomlompom.com/repos/?a=blobdiff_plain;f=src%2Fserver%2Fai.c;h=91a6c8618c918e7eaf925085b1c288f2f5f638da;hb=d304b75ee742d50b6cfa9ad81c44d37fb84a4b5a;hp=b761c6bbbc8039fd2ba75908228f3b006ed9bc8a;hpb=a0e8861d1f1cce921350803bf0499941cb708dec;p=plomrogue

diff --git a/src/server/ai.c b/src/server/ai.c
index b761c6b..91a6c86 100644
--- a/src/server/ai.c
+++ b/src/server/ai.c
@@ -5,7 +5,7 @@
 #include <stdint.h> /* uint8_t, uint16_t, uint32_t, UINT16_MAX */
 #include <stdlib.h> /* free() */
 #include "../common/try_malloc.h" /* try_malloc() */
-#include "field_of_view.h" /* VISIBLE */
+#include "field_of_view.h" /* HIDDEN */
 #include "hardcoded_strings.h" /* s */
 #include "thing_actions.h" /* get_thing_action_id_by_name() */
 #include "things.h" /* struct Thing */
@@ -27,13 +27,11 @@ static void get_neighbor_scores(uint16_t * score_map, uint16_t pos_i,
 
 /* Iterate over scored cells in "score_map" of world.map's geometry. Compare
  * each cell's score against the score of its immediate neighbors in N_DIRS
- * directions. If it's neighbors are low enough that the result would be lower
- * than the current value, re-set it to 1 point higher than its lowest-scored
+ * directions. If any neighbor's score is at least two points lower than the
+ * current cell's score, re-set it to 1 point higher than its lowest-scored
  * neighbor. Repeat this whole process until all cells have settled on their
- * final score. Ignore cells whose position in "score_map" fits cells of
- * unreachable terrain in world.map.cells or whose score is greater than
- * "max_score". Expect "max_score" to be the maximum score for cells, marking
- * them as unreachable.
+ * final score. Ignore cells whose score is greater than "max_score". Expect
+ * "max_score" to be the maximum score for cells, marking them as unreachable.
  */
 static void dijkstra_map(uint16_t * score_map, uint16_t max_score);
 
@@ -133,7 +131,7 @@ static char get_dir_to_nearest_enemy(struct Thing * t_origin)
     for (i = 0; i < map_size; i++)
     {
         score_map[i] = UINT16_MAX;
-        if (t_origin->fov_map[i] & VISIBLE && world.map.cells[i] == '.')
+        if ('.' == t_origin->mem_map[i])
         {
             score_map[i] = max_score;
         }
@@ -141,7 +139,8 @@ static char get_dir_to_nearest_enemy(struct Thing * t_origin)
     struct Thing * t = world.things;
     for (; t != NULL; t = t->next)
     {
-        if (!t->lifepoints || t == t_origin)
+        if (   !t->lifepoints || t == t_origin
+            || HIDDEN == t_origin->fov_map[t->pos.y*world.map.length+t->pos.x])
         {
             continue;
         }