Application of the killer-tree heuristic and the lambda-search method to lines of action

Information Sciences

Volumn 154, Issue 3-4 SPEC., 2003, Pages 141-155

  Sakuta, Makoto ^a   Hashimoto, Tsuyoshi ^a   Nagashima, Jun ^a   Uiterwijk, Jos W H M ^b   Iida, Hiroyuki ^a  

^a SHIZUOKA UNIVERSITY   (Japan)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Endgame search; Killer tree heuristic; Lambda search; Lines of action

Indexed keywords

GAME THEORY; HEURISTIC METHODS; TREES (MATHEMATICS);

ENDGAME SEARCH;

INFORMATION SCIENCE;

EID: 0038344713     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00047-1     Document Type: Article

References (20)

1. Akl S., Newborn M. The principal continuation and the killer heuristic. 1977 ACM Annual Conference Proceedings. 1977;466-473 ACM, Seattle.
2. Hashimoto T., Sakuta M., Iida H. A brinkmate solver and its evaluation. Transactions of the Japanese Society for Artificial Intelligence. 16(6):2001;539-547. (in Japanese, with English abstract).
3. Iida H., Sakuta M., Rollason J. Computer shogi. Artificial Intelligence. 134(1-2):2002;121-144.
4. Kawano Y. Using similar positions to search game trees. Games of No Chance. Nowakowski R.J. MSRI Publications. vol. 29:1996;193-202 Cambridge University Press.
5. Matsubara H., Iida H., Grimbergen R. Natural developments in game research. ICCA Journal. 19(2):1996;103-112.
6. Nagai A. A new AND/OR tree search algorithm using proof number and disproof number. Proceedings of Complex Games Lab Workshop, November. 1998;40-45 ETL, Tsukuba.
7. A. Nagai, A new depth-first-search algorithm for AND/OR trees, M.Sc. Thesis, Department of Information Science, The University of Tokyo, Japan, 1999.
8. A. Nagai, Df-pn Algorithm for Searching AND/OR Trees and Its Applications, Ph.D. Thesis, Department of Information Science, The University of Tokyo, Japan, 2002.
9. A. Nagai, H. Imai, Application of df-pn+ to Othello endgames, in: Proceedings of Game Programming Workshop in Japan '99, Hakone, Japan, October 1999, pp. 16-23.
10. Nelson H. Hash tables in Cray Blitz. ICCA Journal. 8(1):1985;3-134.
11. Sackson S. A Gamut of Games. 1969;Random House, New York, NY, USA.
12. M. Sakuta, Deterministic solving of problems with uncertainty, Ph.D. Thesis, Shizuoka University, Japan, 2001.
13. Sakuta M., Iida H. The performance of PN*, PDS, and PN search on 6. × 6 Othello and tsume-shogi van den Herik H.J., Monien B. Advances in Computer Games. vol. 9:2001;203-222 Universiteit Maastricht, The Netherlands.
14. M. Sakuta, J. Nagashima, T. Hashimoto, H. Iida, Application of the methods developed in the endgame search of shogi to Lines of Action, Journal of the Information Processing Society of Japan, accepted for publication (in Japanese, with English abstract).
15. Seo M., Iida H., Uiterwijk J.W.H.M. The PN*-search algorithm: application to tsume-shogi. Artificial Intelligence. 129:2001;253-277.
16. Tanase Y. The algorithms in IS Shogi. Matsubara H. Advances in Computer Shogi. vol. 3:2000;1-14 Kyoritsu Shuppan, Tokyo. (in Japanese).
17. Thomsen T. Lambda-search in game trees - with application to Go. ICGA Journal. 23(4):2000;203-217.
18. M.H.M. Winands, Analysis and implementation of lines of action, M.Sc. Thesis, Universiteit Maastricht, The Netherlands, 2000.
19. Winands M.H.M., Uiterwijk J.W.H.M., van den Herik H.J. Combining proof-number search with alpha-beta search. Krose B., de Rijke M., Schreiber G., van Someren M. Proceedings of the Thirteenth Belgium-Netherlands Artificial Intelligence Conference (BNAIC 2001). 2001;299-306.
20. Winands M.H.M., Uiterwijk J.W.H.M., van den Herik H.J. The quad heuristic in lines of action. ICGA Journal. 24(1):2001;3-15.