No-search approach in linguistic geometry: experiments with concurrent agents

Describes experiments with a combat simulation tool. This is a linguistic geometry system for the game of four active agents broken into two opposing teams. All the agents can move simultaneously if necessary in a 2D district of size N×N, where N is an arbitrary integer greater than zero. The paper also includes the example of system execution with optimal solution generation and proof of optimality combined in one. This implementation is able of producing optimal decision trees, without search