Sciweavers

70 search results - page 6 / 14
» Thumbs-Up: a game for playing to rank search results
Sort
View
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 7 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
ICCBR
2005
Springer
14 years 1 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
JCT
2010
92views more  JCT 2010»
13 years 6 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
AAAI
2008
13 years 10 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin
CG
2004
Springer
14 years 1 months ago
Searching over Metapositions in Kriegspiel
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player h...
Andrea Bolognesi, Paolo Ciancarini