Abstract
One of the main challenges with selective search extensions is designing effective move categories (features). Usually, it is a manual trial-and-error task, which requires both intuition and expert human knowledge. Automating this task potentially enables the discovery of both more complex and more effective move categories. The current work introduces Gradual Focus, an algorithm for automatically discovering interesting move categories for selective search extensions. The algorithm iteratively creates new more refined move categories by combining features from an atomic feature set. Empirical data is presented for the game Breakthrough showing that Gradual Focus looks at a number of combinations that is two orders of magnitude fewer than a brute-force method does, while preserving adequate precision and recall.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anantharaman, T.S., Campbell, M.S., Hsu, F.: Singular extensions: adding selectivity to brute-force searching. Artificial Intelligence 43(1), 99–109 (1990)
Beal, D.F., Smith, M.C.: Quantification of search extension benefits. ICCA Journal 8(4), 205–218 (1995)
Hyatt, R.M.: Crafty. A chess program (1996) (March 27, 2008), ftp://ftp.cis.uab.edu/pub/hyatt
Levy, D., Broughton, D., Taylor, M.: The SEX algorithm in computer chess. ICCA Journal 12(1), 10–21 (1989)
Tsuruoka, Y., Yokoyama, D., Chikayama, T.: Game-tree search algorithm based on realization probability. ICGA Journal 25(3), 146–153 (2002)
Winands, M.H.M., Björnsson, Y.: Enhanced realization probability search. New Mathematics and Natural Computation 4(3), 329–342 (2008)
Björnsson, Y.: Selective Depth-First Game-Tree Search. Phd dissertation, University of Alberta (2002)
Björnsson, Y., Marsland, T.A.: Learning extension parameters in game-tree search. Information Sciences 154(3-4), 95–118 (2003)
Kocsis, L., Szepesvári, C., Winands, M.H.M.: RSPSA: Enhanced Parameter Optimization in Games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) CG 2005. LNCS, vol. 4250, pp. 39–56. Springer, Heidelberg (2006)
Fawcett, T.E., Utgoff, P.E.: Automatic feature generation for problem solving systems. In: Intern. Conf. on Machine Learning (ICML), pp. 144–153 (1992)
Kaneko, T., Yamaguchi, K., Kawai, S.: Automated identification of patterns in evaluation functions. In: Advances in Computer Games, vol. 10, pp. 279–298 (2003)
Buro, M.: From simple features to sophisticated evaluation functions. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol. 1558, pp. 126–145. Springer, Heidelberg (1999)
Buro, M.: Experiments with Multi-ProbCut and a new high-quality evaluation function for Othello. In: Games in AI Research, pp. 77–96 (1999)
Sturtevant, N.R., White, A.M.: Feature construction for reinforcement learning in hearts. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 122–134. Springer, Heidelberg (2007)
Finkelstein, L., Markovitch, S.: Learning to play chess selectively by acquiring move patterns. ICCA Journal 21(2), 100–119 (1998)
Handscomb, K.: 8×8 game design competition: The winning game: Breakthrough ... and two other favorites. Abstract Games Magazine 7 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skowronski, P., Björnsson, Y., Winands, M.H.M. (2010). Automated Discovery of Search-Extension Features. In: van den Herik, H.J., Spronck, P. (eds) Advances in Computer Games. ACG 2009. Lecture Notes in Computer Science, vol 6048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12993-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-12993-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12992-6
Online ISBN: 978-3-642-12993-3
eBook Packages: Computer ScienceComputer Science (R0)