A speculative strategy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1558, Issue , 1999, Pages 74-92

  Gao, Xinbo ^a   Iida, Hiroyuki ^a   Uiterwijk, Jos W H M ^b   van den Herik, H Jaap ^b  

^a SHIZUOKA UNIVERSITY   (Japan)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Opponent modeling; Othello; Speculative play; 2 pruning

Indexed keywords

TREES (MATHEMATICS);

GAME TREES; OPPONENT MODELING; OTHELLO; SPECULATIVE PLAY;

COMPUTER GAMES;

EID: 14744306098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48957-6_5     Document Type: Conference Paper

References (16)

1. G.M. Adelson-Velskiy, V.L. Arlazarov and M.V. Donskoy. Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence, 6(4):361-371, 1975.
2. M. Buro. ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm. ICCA Journal, 18(2):71-76, 1995.
3. D. Carmel and S. Markovitch. Pruning Algorithms for Multi-Model Adversary Search. Artificial Intelligence, 99(2):325-355, 1998.
4. H. Iida, J.W.H.M. Uiterwijk, and H.J. van den Herik. Opponent-Model Search. Technical Reports in Computer Science, CS 93-03. Department of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands, 1993.
5. H. Iida, J.W.H.M. Uiterwijk, H.J. van den Herik, and I.S. Herschberg. Potential Applications of Opponent-Model Search. Part 1: The Domain of Applicablity. ICCA Journal, 16(4):201-208, 1993.
6. H. Iida. Heuristic Theories on Game-Tree Search. Ph.D. thesis, Tokyo University of Agriculture and Technology, Tokyo, Japan, 1994.
7. H. Iida, K. Handa, and J.W.H.M. Uiterwijk. Tutoring Strategies in Game-Tree Search. ICCA Journal, 18(4):191-204, 1995.
8. H. Iida, I. Kotani, J.W.H.M. Uiterwijk, and H.J. van den Herik. Gains and Risks of OM Search. Advances in Computer Chess 8 (eds. H.J. van den Herik and J.W.H.M. Uiterwijk), pages 153-165. Universiteit Maastricht, Maastricht, The Netherlands, 1997.
9. H. Iida, J.W.H.M. Uiterwijk, and H.J. van den Herik. Cooperative Strategies for Pair Playing. IJCAI-97 workshop proceedings: Using Games as an Experimental testbed for AI Research (ed. H. Iida), pages 85-90. Nagoya, Japan, 1997.
10. H. Kitano, M. Asada, Y. Kuniyoahi, I. Noda, and E. Osawa. Robocup: The Robot World Cup Initiative. Proceedings of the IJCAI-95 Workshop on Entertainment and AI/Life (eds. H. Kitano, J. Bates and B. Hayes-Roth), pages 19-24. IJCAI, Montreal, Québec, 1995.
11. D.E. Knuth and R.W. Moore. An Analysis of Alpha-Beta Pruning. Artificial Intelligence, 6:293-326, 1975.
12. T.A. Marsland. Relative Efficiency of Alpha-Beta Implementations. Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI-83), pages 763-766, 1983.
13. A. Muszycka and R. Shinghal. An Empirical Comparison of Pruning Strategies in Game Trees. IEEE Transactions, SMC-15(3):389-399, 1985.
14. M.M. Newborn. The Efficiency of the Alpha-Beta Search on Trees with Branch- dependent Terminal Node Scores. Artificial Intelligence, 8:137-153, 1977.
15. A. Plaat, J. Schaeffer, W. Pijls, and A. de Bruin. Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, 87(1-2):255-293, 1996.
16. D.B. Pritchard. The Encyclopedia of Chess Variants. Games & Puzzles Publications, Godalming, Surrey, UK, 1994.