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.
|Title of host publication||Advances in Computer Games|
|Subtitle of host publication||12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers|
|Editors||H. Jaap van den Herik, Pieter Spronck|
|Place of Publication||Berlin, Heidelberg|
|Number of pages||13|
|Publication status||Published - 2010|
|Series||Lecture Notes in Computer Science|