GHOST is a framework to help game developers to model and implement their own optimization problems, or to simply instantiate a problem already encoded in GHOST. Previous works show that GHOST leads to high-quality solutions in some tens of milliseconds for three RTS-related problems: build order, wall-in placement and target selection. In this paper, we present two new problems in GHOST: pathfinding and resource allocation. The goal of this paper is to show the robustness of the framework, having very good results for a problem it is not designed for (pathfinding), and to show its flexibility, where it is easy to propose different models of the same problem (resource allocation problem).