CG
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we explore the tactical aspects needed for the creation of an intelligent computer-pool player. The research results in three modifications to our previous model. An ...
APGV
2006
ACM
13 years 9 months ago
2006
ACM
One of the most important, still unsolved problems in computer graphics is the generation of predictive imagery, i.e., images that represent perfect renditions of reality. Such pe...
AMDO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a new method to simulate deformable volumetric objects interactively using finite elements. With quadratic basis functions and a non-linear strain tensor, we a...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. By developing an intelligent computer system that will provide commentary of chess moves in a comprehensible, user-friendly and instructive way, we are trying to use the ...
CG
2008
Springer
13 years 9 months ago
2008
Springer
CG
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
CG
2008
Springer
13 years 9 months ago
2008
Springer
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an ...