{"version":"1.0","type":"link","title":"Paranoid algorithm - Newikis","description":"In combinatorial game theory, the paranoid algorithm is a game tree search algorithm designed to analyze multi-player games using a two-player adversarial framework. The algorithm assumes all opponents form a coalition to minimize the focal player’s payoff, transforming an n-player non-zero-sum…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}