On Pruning Techniques for Multi-Player Games

Nathan Sturtevant, R. K. (2000). On Pruning Techniques for Multi-Player Games.

Type

Unclassified

Intellectual base

Unclassified

Year

2000

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Paranoid algorithm
  • The algorithm collapses an n-player utility vector into a two-sided zero-sum search between the chosen player and an adversarial coalition, enabling ordinary minimax and alpha-beta pruning.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:455e6d69b9d8 · see in the full table