Sciweavers

32 search results - page 6 / 7
» Combining Tactical Search and Monte-Carlo in the Game of Go
Sort
View
GAMEON
2001
13 years 10 months ago
A New Computational Approach to the Game of Go
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...
Julian Churchill, Richard Cant, David Al-Dabass
FLAIRS
2003
13 years 10 months ago
Learning Opening Strategy in the Game of Go
In this paper, we present an experimental methodology and results for a machine learning approach to learning opening strategy in the game of Go, a game for which the best compute...
Timothy Huang, Graeme Connell, Bryan McQuade
ACG
2006
Springer
14 years 2 months ago
Recognizing Seki in Computer Go
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
Xiaozhen Niu, Akihiro Kishimoto, Martin Mülle...
BMCBI
2011
13 years 3 months ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...
ICML
2008
IEEE
14 years 9 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...