241 search results - page 3 / 49 » A New Computational Approach to the Game of Go |
ACG
2006
Springer
15 years 5 months ago
2006
Springer
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...
75
Voted
AI
2002
Springer
14 years 11 months ago
2002
Springer
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...
89
Voted
ACG
2006
Springer
15 years 5 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
98
Voted
IJCAI
2007
15 years 1 months ago
2007
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...
NIPS
1993
15 years 29 days ago
1993
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...