The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Dao is an attractive game to play, although it is solvable in a few seconds on a computer. The game is so small that the complete game graph can be kept in internal memory. At the same time, the number of nodes in the game graph of Dao is large enough to allow interesting analyses. In the game spectrum, Dao resides between on the one hand trivial games such as Tic-Tac-Toe and Do-Guti and on the other...
In this paper we introduce a new pruning mechanism, called Similarity Pruning for Probabilistic Opponent-Model (PrOM) Search. It is based on imposing a bound on the differences between two or more evaluation functions. Assuming such a bound exists, we are able to prove two theoretical properties, viz., the bound-conservation property and the bounded-gain property. Using these properties we develop...