• DOI:10.1016/0004-3702(91)90082-U
Corpus ID: 14171052

Multi-Player Alpha-Beta Pruning

@article{Korf1991MultiPlayerAP,
  title={Multi-Player Alpha-Beta Pruning},
  author={R. Korf},
  journal={Artif. Intell.},
  year={1991},
  volume={48},
  pages={99-111}
}

R. Korf

Published 1991

Mathematics, Computer Science

Artif. Intell.

Korf, R.E., Multi-player alpha-beta pruning (Research Note), Artificial Intelligence 48 (1991) 99-111. We consider the generalization of minimax search with alpha-beta pruning to non-cooperative, perfect-information games with more than two players. The minimax algorithm was generalized in [2] to the maxn algorithm applied to vectors of n-tuples representing the evaluations for each of the players. If we assume an upper bound on the sum of the evaluations for each player, and a lower bound on… CONTINUE READING

View via Publisher

cc.gatech.edu

Save to Library

Create Alert

Cite

Launch Research Feed