No-search approach in linguistic geometry: construction of strategies

Linguistic geometry includes mathematical models and tools for knowledge representation and reasoning about multiagent discrete pursuit-evasion games. A new approach to solving a class of search problems without search is shown on example of the aircraft war game. The paper includes the second part of the solution construction. Based on the state space chart a full set of strategies is constructed; one of them is implemented as a solution tree. It is proved that the only optimal strategy in this problem is the draw strategy; implementation of this strategy in the start state is the optimal solution.