Last-branch and speculative pruning algorithms for max

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 669-675

  Sturtevant, Nathan ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHA-BETA; BRANCH AND BOUNDS; BRANCHING FACTORS; GAME TREES; MULTIPLAYER GAMES; PRUNING ALGORITHMS; PRUNING TECHNIQUES; TERMINAL VALUES;

ARTIFICIAL INTELLIGENCE; FORESTRY; TREES (MATHEMATICS);

ALGORITHMS;

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

References (9)

1. [Ginsberg, 20011 GIB: Imperfect Information in a Computationally Challenging Game, Journal of Artificial Intelligence Research, 14,2001,303-358.
2. [Knuth and Moore, 1975] An Analysis of Alpha-Beta Pruning, Artificial Intelligence, vol. 6 no. 4, 1975, 293-326.
3. [Korf 1991] Multiplayer Alpha-Beta Pruning, Artificial Intelligence, vol. 48 no. 1, 1991,99-111.
4. [Luckhardt and Irani, 1986 An algorithmic solution of N-person games, Proceedings AAA1-86, Philadelphia, PA, 158-162.
5. [Pearl, 1980] Asymptotic properties of minimax trees and game-searching procedures. Artificial Intelligence vol 14 no 2,1980,113-138.
6. tPearl, 1984] Heuristics, Addison-Wesley, Reading, MA, 1984.
7. rd International Conference on Computers and Games, 2002.
8. [Sturtevant and Korf, 2000] On Pruning Techniques lor Multi-Player Games, Proceedings AAAI-00, Austin, TX, 201-207.
9. [Sturtevant, 2003] Multi-Player Games: Algorithms and Approaches, PhD Thesis, UCLA.