On Pruning Techniques for Multi-Player Games

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 201-207

  Sturtevant, Nathan R ^a   Korf, Richard E ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS;

% REDUCTIONS; ALPHA-BETA; ALPHA-BETA PRUNING; BRANCH AND BOUNDS; MINIMAX; MONOTONICS; MULTIPLAYER GAMES; N-PLAYER GAMES; PRUNING TECHNIQUES; SEARCH TREES;

EXPANSION;

EID: 33745121225     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Ginsberg, M, GIB: Steps Toward an Expert-Level Bridge-Playing Program, Proceedings, IJCAI-99, 584-589.
2. Ginsberg, M, How Computers Will Play Bridge, The Bridge World, 1996.
3. Ginsberg, M, Partition Search, Proceedings AAAI-96, Portland, OR, 228-33.
4. Hoyle, E., and Frey, R.L., Morehead, A.L., and Mott-Smith, G, 1991, The Authoritative Guide to the Official Rules of All Popular Games of Skill and Chance, Doubleday.
5. Knuth, D.E., and Moore, R.W., An analysis of alpha-beta pruning, Artificial Intelligence, vol. 6 no. 4, 1975, 293-326.
6. Korf, R.E. Multiplayer alpha-beta pruning. Artificial Intelligence, vol. 48 no. 1, 1991, 99-111.
7. Luckhardt, C.A., and Irani, K.B., An algorithmic solution of N-person games, Proceedings AAAI-86, Philadelphia, PA, 158-162.
8. Prieditis, A.E.; Fletcher, E. Two-agent IDA*, Journal of Experimental and Theoretical Artificial Intelligence, vol.10, Taylor & Francis, 1998, 451-85.