Sciweavers

GAMEON
2001
13 years 11 months ago
A Learning Architecture for the Game of Go
In this paper, a three-component architecture of a learning environment for Go is sketched, which can be applied to any two-player, deterministic, full information, partizan, comb...
A. B. Meijer
CG
2004
Springer
14 years 1 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
ACG
2006
Springer
14 years 4 months ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003
COCOA
2007
Springer
14 years 4 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg