Sciweavers

65 search results - page 1 / 13
» Heuristic Search Applied to Abstract Combat Games
Sort
View
AI
2005
Springer
13 years 9 months ago
Heuristic Search Applied to Abstract Combat Games
Alexander Kovarsky, Michael Buro
BIRTHDAY
2006
Springer
13 years 11 months ago
Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
Roberto Cordeschi
ACG
2009
Springer
14 years 2 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
ESANN
2008
13 years 9 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
ACG
2009
Springer
13 years 11 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller