Sciweavers

ACG
2006
Springer
13 years 8 months ago
Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
Yoshinori Higashiuchi, Reijer Grimbergen
ACG
2006
Springer
13 years 10 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
ACG
2006
Springer
13 years 10 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...
ACG
2006
Springer
13 years 10 months ago
A New Family of k-in-a-Row Games
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 ...
I-Chen Wu, Dei-Yen Huang
ACG
2006
Springer
13 years 10 months ago
An Event-Based Pool Physics Simulator
A method to simulate the physics of the game of pool is presented. The method is based upon a parametrization of ball motion which allows the time of occurrence of events, such as...
Will Leckie, Michael A. Greenspan
ACG
2006
Springer
13 years 10 months ago
RSPSA: Enhanced Parameter Optimization in Games
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
Levente Kocsis, Csaba Szepesvári, Mark H. M...
ACG
2006
Springer
13 years 10 months ago
On Colored Heap Games of Sumbers
Kuo-Yuan Kao
ACG
2006
Springer
13 years 10 months ago
Automatic Generation of Search Engines
A plethora of enhancements are available to be used together with the αβ search algorithm. There are so many, that their selection and implementation is a non-trivial task, even ...
Markian Hlynka, Jonathan Schaeffer
ACG
2006
Springer
13 years 10 months ago
A Phantom-Go Program
Abstract. This paper presents a Phantom Go program. It is based on a MonteCarlo approach. The program plays Phantom Go at an intermediate level.
Tristan Cazenave
ACG
2006
Springer
13 years 10 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy