Sciweavers

121
Voted
ACG
2009
Springer
15 years 7 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
ACG
2009
Springer
15 years 7 months ago
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
Markus Enzenberger, Martin Müller 0003
100
Voted
ACG
2009
Springer
15 years 7 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
ACG
2009
Springer
15 years 7 months ago
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta
ACG
2009
Springer
15 years 7 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
Computer Graphics
Top of PageReset Settings