Searchand knowledge in Lines of Action

IFIP Advances in Information and Communication Technology

Volumn 135, Issue , 2004, Pages 231-248

  Billings, D ^a   Bjomsson Y ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Knowledge; Lines of Action; Search

Indexed keywords

INFORMATION TECHNOLOGY;

DESIGN AND DEVELOPMENT; DESIGN PHILOSOPHY; GAME-PLAYING PROGRAMS; INTERNATIONAL E-MAIL; KNOWLEDGE; KNOWLEDGE LEVEL; LINES OF ACTION; SEARCH;

COMPUTER GAMES;

EID: 84902459472     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. Beai, D. (1989). Experiments with the null move. In Advances in Computer Chess 5, pages 65-89 Elsevier Science Publishers B.V. D. Beai (editor).
2. Berliner, H., Goetsch, G., Campbell, M. S., and Ebeling, C. (1990). Measuring the performance potential of chess programs. Artificial Intelligence, 43(1):7-20
3. Billings, D. (2000). http: 1 /www. cs. ualberta. cargames/LDA/.
4. Bjornsson, Y. and Marsland, T. (2001). Multi-cut alpha-beta pruning in game-tree search. Theoretical Computer Science, 252:177-196
5. Bjornsson, Y. and Winands, M. (2002). YL wins Lines of Action tournament. ICGA Journal, 25(3):185-186 See also: 23(3):179-179, and 24(3):180-181
6. Buro, M. (1999). From simple features to sophisticated evaluation functions. In Proceedings of The Ist International Conference on Computers and Games (CG '98). LNCS special issue Computers and Games, pages 126-145 Springer-Verlag, Berlin, Germany.
7. Dyer, D. (2003). Lines of action. http: 1 /www. andromeda. com/people/ ddyer /loa/.
8. Handscornb, K. (2003). Abstract Games. http: 1 /www. abstractgamesmagazine. com.
9. Heinz, E. (2000). Scalable search in computer chess. Vieweg Verlag, Germany.
10. Heinz, E. (2001). Self-play, deep search and diminishing returns. ICCA Journal, 24(2):75-79
11. Junghanns, A. and Schaeffer, J. (1997). Search versus knowledge in game-playing programs revisited. In IJCAI-97, pages 692-697
12. Marsland, T. A. (1982). Relative performance ofthe alpha-beta algorithm. ICCA Journal, 5(2):21-24
13. Sackson, S. (1969). A Gamut ofGames. Random House.
14. Sakuta, M., Hashimoto, T., Nagashima, J., and lida, H. (2002). Endgame-search techniques developed in shogi: application to Lines of Action. In Caulfield, H. et al., editor, Proceedings of JCIS 2002, pages 458-460
15. Schaeffer, J. (1986). Experiments in search and knowledge. Ph.D. thesis, Department of Computing Science, University of Waterloo, Canada.
16. Winands, M.H.M., Uiterwijk, J.W.H.M., and Van den Herik, H.J. (2002). PDS-PN: A new proofnumber search algorithm: Application to Lines of Action. In Proceedings of The 3rd International Conference on Computers and Games (CG '02). To appear.