{'fraction_non_alphanumeric': 0.016857720836142953, 'fraction_numerical': 0.0, 'mean_word_length': 4.578947368421052, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On a finite state space pursuit evasion game with dynamic information

The game to be discussed belongs to the class of two-person zero-sum dynamic games. The players move in a plane and are unaware of each other's positions unless a player flashes a search light which illuminates an area of known shape around this player. By flashing his search light a player discloses his position to the other player, wherever he is. Termination occurs when this other player finds himself trapped within the area illuminated by the search light. Both players want to catch the other player before they are caught themselves. This problem has been investigated for a finite state space (the players move on a network with a finite number of nodes) and for the discrete-time case. Both a normal and an extensive form description of the game can be given; they are equivalent and the former one is more amenable for obtaining numerical results. In essence, finding the saddle-point strategies boils down to the solution of a two-level linear programming problem. Explicit results have been obtained when the players are confined to the circumference of a circle and during each time step each player can either move to one of the neighbouring nodes or stay where he is. Specific results depend on the number of nodes and the shape of the illluminated area. If the total number of flashes (available to both players) does not exceed two, then the class of mixed and behavioral strategies coincide.