X-Git-Url: https://plomlompom.com/repos/?a=blobdiff_plain;f=src%2Fserver%2Fai.c;h=cdefca844bb78dc87277b409d25f2f12ce183137;hb=3dedf6344c941891491773d1cc5d647aa664b218;hp=9e317a18543ad769086473d3d899984aa7f3f8ac;hpb=b3c95117ef622d1bb9f1c663b1d1b0c41755ce9b;p=plomrogue

diff --git a/src/server/ai.c b/src/server/ai.c
index 9e317a1..cdefca8 100644
--- a/src/server/ai.c
+++ b/src/server/ai.c
@@ -2,13 +2,13 @@
 
 #include "ai.h"
 #include <stddef.h> /* NULL */
-#include <stdint.h> /* uint8_t, uint16_t, uint32_t, UINT16_MAX */
+#include <stdint.h> /* uint8_t, uint16_t, uint32_t, int16_t, UINT16_MAX */
 #include <stdlib.h> /* free() */
 #include "../common/try_malloc.h" /* try_malloc() */
 #include "hardcoded_strings.h" /* s */
 #include "thing_actions.h" /* get_thing_action_id_by_name() */
-#include "things.h" /* struct Thing */
-#include "world.h" /* global world */
+#include "things.h" /* Thing, ThingType, ThingInMemory */
+#include "world.h" /* world */
 
 
 
@@ -34,13 +34,31 @@ static void get_neighbor_scores(uint16_t * score_map, uint16_t pos_i,
  */
 static void dijkstra_map(uint16_t * score_map, uint16_t max_score);
 
-/* Return numpad char of direction ("8", "6", "2", "4" etc.) of enemy with the
- * shortest path visible to "t_origin". If no enemy is around, return 0.
+/* get_dir_to_nearest_thing() helper: Prepare "score_map" for dijkstra_map(). */
+static void init_score_map(char filter, uint16_t * score_map, uint32_t map_size,
+                           struct Thing * t_eye);
+
+/* Set (if possible) as "t_eye"'s command a move to the path to the path-wise
+ * nearest thing that is not "t_eye" and fits criteria set by "filter". On
+ * success, return 1, else 0. Values for "filter":
+ * "e": thing in FOV is animate, but not of "t_eye"'s thing type; build path as
+ *      avoiding things of "t_eye"'s type
+ * "c": thing in memorized map is consumable.
+ */
+static uint8_t get_dir_to_nearest_thing(struct Thing * t_eye, char filter);
+
+/* Return 1 if any thing not "t_eye" is known and fulfills some criteria defined
+ * by "filter", else 0. Values for "filter":
+ * "e": thing in FOV is animate, but not of "t_eye"'s thing type
+ * "c": thing in memorized map is consumable
  */
-static char get_dir_to_nearest_enemy(struct Thing * thing_origin);
+static uint8_t seeing_thing(struct Thing * t_eye, char filter);
+
+/* Return slot ID of strongest consumable in "t_owner"'s inventory, else -1. */
+static int16_t get_inventory_slot_to_consume(struct Thing * t_owner);
 
-/* Return 1 if any animate thing not "t_origin" is in its field of view. */
-static uint8_t seeing_enemies(struct Thing * t_origin);
+/* Return 1 if "t_standing" is standing on a consumable, else 0. */
+static uint8_t standing_on_consumable(struct Thing * t_standing);
 
 
 
@@ -120,72 +138,163 @@ static void dijkstra_map(uint16_t * score_map, uint16_t max_score)
 
 
 
-static char get_dir_to_nearest_enemy(struct Thing * t_origin)
+static void init_score_map(char filter, uint16_t * score_map, uint32_t map_size,
+                           struct Thing * t_eye)
 {
-    /* Calculate for each cell distance to visibly nearest enemy, with movement
-     * possible in the directions or "dir". (Actor's own cells start with 0
-     * distance towards themselves. Cells of actors of own type are invisible.)
-     */
-    uint32_t map_size = world.map.length * world.map.length;
-    uint16_t max_score = UINT16_MAX - 1;
-    uint16_t * score_map = try_malloc(map_size * sizeof(uint16_t), __func__);
     uint32_t i;
     for (i = 0; i < map_size; i++)
     {
         score_map[i] = UINT16_MAX;
-        if ('.' == t_origin->mem_map[i])
+        if ('.' == t_eye->mem_map[i])
         {
-            score_map[i] = max_score;
+            score_map[i] = UINT16_MAX-1;
         }
     }
-    struct Thing * t = world.things;
-    for (; t != NULL; t = t->next)
+    if      ('e' == filter)
     {
-        if (   !t->lifepoints || t == t_origin
-            || 'H' == t_origin->fov_map[t->pos.y * world.map.length + t->pos.x])
+        struct Thing * t = world.things;
+        for (; t; t = t->next)
         {
-            continue;
+            if (   t==t_eye || !t->lifepoints
+                || 'H' == t_eye->fov_map[t->pos.y*world.map.length + t->pos.x])
+            {
+                continue;
+            }
+            else if (t->lifepoints && t->type == t_eye->type)
+            {
+                score_map[t->pos.y * world.map.length + t->pos.x] = UINT16_MAX;
+                continue;
+            }
+            score_map[t->pos.y * world.map.length + t->pos.x] = 0;
         }
-        if (t->lifepoints && t->type == t_origin->type)
+    }
+    else if ('c' == filter)
+    {
+        struct ThingInMemory * tm = t_eye->t_mem;
+        for (; tm; tm = tm->next)
         {
-            score_map[t->pos.y * world.map.length + t->pos.x] = UINT16_MAX;
-            continue;
+            if (' ' == t_eye->mem_map[tm->pos.y * world.map.length + tm->pos.x])
+            {
+                continue;
+            }
+            struct ThingType * tt = get_thing_type(tm->type);
+            if (!tt->consumable)
+            {
+                continue;
+            }
+            score_map[tm->pos.y * world.map.length + tm->pos.x] = 0;
         }
-        score_map[t->pos.y * world.map.length + t->pos.x] = 0;
     }
-    dijkstra_map(score_map, max_score);
+}
+
+
 
-    /* Return direction of "t_origin"'s lowest-scored neighbor cell. */
-    uint16_t neighbors[N_DIRS];
-    uint16_t pos_i = (t_origin->pos.y * world.map.length) + t_origin->pos.x;
-    get_neighbor_scores(score_map, pos_i, max_score, neighbors);
-    free(score_map);
+static uint8_t get_dir_to_nearest_thing(struct Thing * t_eye, char filter)
+{
     char dir_to_nearest_enemy = 0;
-    uint16_t min_neighbor = max_score;
-    char * dirs = "edcxsw";    /* get_neighbor_scores()'s clockwise dir order.*/
-    for (i = 0; i < N_DIRS; i++)
+    if (seeing_thing(t_eye, filter))
     {
-        if (min_neighbor > neighbors[i])
+        uint32_t map_size = world.map.length * world.map.length;
+        uint16_t * score_map = try_malloc(map_size * sizeof(uint16_t),__func__);
+        init_score_map(filter, score_map, map_size, t_eye);
+        dijkstra_map(score_map, UINT16_MAX-1);
+        uint16_t neighbors[N_DIRS];
+        uint16_t pos_i = (t_eye->pos.y * world.map.length) + t_eye->pos.x;
+        get_neighbor_scores(score_map, pos_i, UINT16_MAX-1, neighbors);
+        free(score_map);
+        uint16_t min_neighbor = UINT16_MAX-1;
+        char * dirs = "edcxsw";/* get_neighbor_scores()'s clockwise dir order.*/
+        uint8_t i;
+        for (i = 0; i < N_DIRS; i++)
         {
-            min_neighbor = neighbors[i];
-            dir_to_nearest_enemy = dirs[i];
+            if (min_neighbor > neighbors[i])
+            {
+                min_neighbor = neighbors[i];
+                dir_to_nearest_enemy = dirs[i];
+            }
         }
     }
-    return dir_to_nearest_enemy;
+    if (dir_to_nearest_enemy)
+    {
+        t_eye->command = get_thing_action_id_by_name(s[S_CMD_MOVE]);
+        t_eye->arg = dir_to_nearest_enemy;
+        return 1;
+    }
+    return 0;
 }
 
 
 
-static uint8_t seeing_enemies(struct Thing * t_origin)
+static uint8_t seeing_thing(struct Thing * t_eye, char filter)
+{
+    if (t_eye->fov_map && 'e' == filter)
+    {
+        struct Thing * t = world.things;
+        for (; t; t = t->next)
+        {
+            if (   t != t_eye
+                && 'v' == t_eye->fov_map[t->pos.y*world.map.length + t->pos.x])
+            {
+                if (t->lifepoints && t->type != t_eye->type)
+                {
+                    return 1;
+                }
+            }
+        }
+    }
+    else if (t_eye->mem_map && 'c' == filter)
+    {
+        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])
+            {
+                struct ThingType * tt = get_thing_type(tm->type);
+                if (tt->consumable)
+                {
+                    return 1;
+                }
+            }
+        }
+    }
+    return 0;
+}
+
+
+
+static int16_t get_inventory_slot_to_consume(struct Thing * t_owner)
+{
+    uint8_t compare_consumability = 0;
+    int16_t selection = -1;
+    struct Thing * t = t_owner->owns;;
+    uint8_t i;
+    for (i = 0; t != NULL; t = t->next, i++)
+    {
+        struct ThingType * tt = get_thing_type(t->type);
+        if (tt->consumable > compare_consumability)
+        {
+            compare_consumability = tt->consumable;
+            selection = i;
+        }
+    }
+    return selection;
+}
+
+
+
+static uint8_t standing_on_consumable(struct Thing * t_standing)
 {
     struct Thing * t = world.things;
     for (; t != NULL; t = t->next)
     {
-        if (   t->lifepoints
-            && t != t_origin
-            && 'v' == t_origin->fov_map[t->pos.y * world.map.length + t->pos.x])
+        if (   t != t_standing
+            && t->pos.y == t_standing->pos.y && t->pos.x == t_standing->pos.x)
         {
-            return 1;
+            struct ThingType * tt = get_thing_type(t->type);
+            if (tt->consumable)
+            {
+                return 1;
+            }
         }
     }
     return 0;
@@ -196,13 +305,21 @@ static uint8_t seeing_enemies(struct Thing * t_origin)
 extern void ai(struct Thing * t)
 {
     t->command = get_thing_action_id_by_name(s[S_CMD_WAIT]);
-    if (seeing_enemies(t))
+    if (!get_dir_to_nearest_thing(t, 'e'))
     {
-        char sel = t->fov_map ? get_dir_to_nearest_enemy(t) : 0;
-        if (0 != sel)
+        int16_t sel = get_inventory_slot_to_consume(t);
+        if (-1 != sel)
+        {
+            t->command = get_thing_action_id_by_name(s[S_CMD_USE]);
+            t->arg = (uint8_t) sel;
+        }
+        else if (standing_on_consumable(t))
+        {
+            t->command = get_thing_action_id_by_name(s[S_CMD_PICKUP]);
+        }
+        else
         {
-            t->command = get_thing_action_id_by_name(s[S_CMD_MOVE]);
-            t->arg = sel;
+            get_dir_to_nearest_thing(t, 'c');
         }
     }
 }