Sciweavers

12 search results - page 2 / 3
» Game Over: Black to Play and Draw in Checkers
Sort
View
CG
2002
Springer
13 years 4 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant
COLT
2008
Springer
13 years 6 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
CIG
2005
IEEE
13 years 10 months ago
Further Evolution of a Self-Learning Chess Program
Previous research on the use of coevolution to improve a baseline chess program demonstrated a performance rating of 2550 against Pocket Fritz 2.0 (PF2). A series of 12 games (6 wh...
David B. Fogel, Timothy J. Hays, Sarah L. Hahn, Ja...
AAAI
1996
13 years 6 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
NIPS
2007
13 years 6 months ago
TrueSkill Through Time: Revisiting the History of Chess
We extend the Bayesian skill rating system TrueSkill to infer entire time series of skills of players by smoothing through time instead of filtering. The skill of each participat...
Pierre Dangauthier, Ralf Herbrich, Tom Minka, Thor...