RTS: Bulletproof algorithm

build/rtsgame/map.core

@@ -19,7 +19,6 @@ MAP_Actor :: struct
   target_p: V2I
   map: *MAP_Map
 
-  state: int
   open_paths: Array(MAP_Path)
   close_paths: Array(MAP_Path)
   tiles_visited: Array(V2I)
@@ -49,6 +48,11 @@ MAP_ActorSetP :: (actor: *MAP_Actor, p: V2I)
   *new_tile |= MAP_TILE_ACTOR_IS_STANDING
   actor.p = p
 
+  Reset(&actor.tiles_visited)
+  Reset(&actor.history)
+  Reset(&actor.open_paths)
+  Reset(&actor.close_paths)
+
 MAP_GetRandomP :: (m: *MAP_Map): V2I
   result := V2I{GetRandomValue(0, MAP_CurrentMap.x), GetRandomValue(0, MAP_CurrentMap.y)}
   return result
@@ -137,22 +141,25 @@ MAP_MoveTowardsTarget :: (s: *MAP_Actor)
     Assert(*new_tile == 0)
     *new_tile |= MAP_TILE_ACTOR_IS_STANDING
 
-    s.state = MAP_PATH_SEARCHING
     Reset(&s.open_paths)
     Reset(&s.close_paths)
     Reset(&s.history)
 
 MAP_PathFindStep :: (s: *MAP_Actor)
-  if s.state == MAP_PATH_REACHED ;; return
   if s.open_paths.len == 0
     MAP_InsertOpenPath(s, s.p, s.p, ignore_blocks = true)
 
+  if s.close_paths.len != 0
+    last := GetLast(&s.close_paths)
+    reached_target := last.p.x == s.target_p.x && last.p.y == s.target_p.y
+    if reached_target
+      return
+
   it := Pop(&s.open_paths)
   Add(&s.close_paths, it)
 
   reached_target := it.p.x == s.target_p.x && it.p.y == s.target_p.y
   if reached_target
-    s.state = MAP_PATH_REACHED
     return
 
   // @language_todo: Add continue keyword