Gave up on trying to get the GOAP algorithm to correctly apply the cost structure to competing choices, and instead I take the resulting action list and simply find the next best one based on cost.

ai_debug.hpp

@@ -2,6 +2,7 @@
 #include "goap.hpp"
 
 namespace ai {
+  AIProfile* profile();
   void dump_only(State state, bool matching, bool show_as);
   void dump_state(State state);
   void dump_action(Action& action);