Titlebook: Computers and Games; 6th International Co H. Jaap Herik,Xinhe Xu,Mark H. M. Winands Conference proceedings 2008 The Editor(s) (if applicabl

gratuity

书目名称Computers and Games影响因子(影响力)




书目名称Computers and Games影响因子(影响力)学科排名




书目名称Computers and Games网络公开度




书目名称Computers and Games网络公开度学科排名




书目名称Computers and Games被引频次




书目名称Computers and Games被引频次学科排名




书目名称Computers and Games年度引用




书目名称Computers and Games年度引用学科排名




书目名称Computers and Games读者反馈




书目名称Computers and Games读者反馈学科排名

JECT

向外供接触

盖他为秘密

https://doi.org/10.1007/978-0-387-71043-3ts show that the approach is more than 30 times faster than normal df-pn when we generate almost all legal moves (about 300 moves on average). The required time for processing remained approximately four times as long as that of df-pn using heuristic pruning (about 20 moves on average), but the corr

subordinate

Absenteeism

Multimedia Systems and Applicationson of material are advantageous to a player. Our experimental results show that the performance of the algorithm is good and reliable. Therefore, building a large knowledge database of material combinations is recommended.

Absenteeism

Using Artificial Boundaries in the Game of Go, close off an area. This paper describes a new general framework for finding boundaries in a way such that existing local search methods can be used. Furthermore, by using a revised local UCT search method, it is shown experimentally that this framework increases performance on local Go problems with open boundaries.

不适

https://doi.org/10.1007/3-540-55075-5uation function. In this paper we investigate whether Monte-Carlo Tree Search (MCTS) is an interesting alternative for one-player games where A* and IDA* methods do not perform well. Therefore, we propose a new MCTS variant, called Single-Player Monte-Carlo Tree Search (SP-MCTS). The selection and b

使迷醉

depreciate

Lecture Notes in Computer Scienceor the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and selection strategy. It is able to prove the game-theore