Paranoid algorithm
id:
paranoid-algorithm-187-11572061
title:
Paranoid algorithm
text:
In combinatorial game theory, the paranoid algorithm is an algorithm that aims to improve the alpha-beta pruning capabilities of the maxn algorithm by making the player p chosen to maximize the score "paranoid" of the other players by assuming they are cooperating to minimize p's score, thus minimizing any n-player game to a two-player game by making the opposing player the sum of the other player's scores. This returns the game to a zero-sum game and makes it analyzable via any optimization tec
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm in game theory
original url:
https://en.wikipedia.org/wiki/Paranoid_algorithm
date created:
2024-08-21T16:15:15Z
date modified:
2024-09-08T19:01:42Z
main entity:
{"identifier":"Q130240008","url":"https://www.wikidata.org/entity/Q130240008"}
image:
fields total:
13
integrity:
15