Titlebook: Computers and Games; 7th International Co H. Jaap Herik,Hiroyuki Iida,Aske Plaat Conference proceedings 2011 The Editor(s) (if applicable)

投降

書(shū)目名稱(chēng)Computers and Games影響因子(影響力)




書(shū)目名稱(chēng)Computers and Games影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Computers and Games網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Computers and Games網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Computers and Games被引頻次




書(shū)目名稱(chēng)Computers and Games被引頻次學(xué)科排名




書(shū)目名稱(chēng)Computers and Games年度引用




書(shū)目名稱(chēng)Computers and Games年度引用學(xué)科排名




書(shū)目名稱(chēng)Computers and Games讀者反饋




書(shū)目名稱(chēng)Computers and Games讀者反饋學(xué)科排名

curettage

Recess

Scalability and Parallelization of Monte-Carlo Tree Search,e implications in terms of parallelization. We focus on our Go program . and our Havannah program.. We use multicore machines and message-passing machines. For both games and on both type of machines we achieve adequate efficiency for the parallel version. However, in spite of promising results in s

Forsake

Computational Experiments with the RAVE Heuristic,at often improves the performance of UCT-based algorithms. However, there are situations where RAVE misleads the search whereas pure UCT search can find the correct solution. Two games, the simple abstract game Sum of Switches (.) and the game of Go, are used to study the behavior of the RAVE heuris

修飾

Monte-Carlo Simulation Balancing in Practice, been tested in a very artificial setting: it was limited to 5×5 and 6×6 Go, and required a stronger external program that served as a supervisor. In this paper, the effectiveness of simulation balancing is demonstrated in a more realistic setting. A state-of-the-art program, ., learned an improved

Celiac-Plexus

Celiac-Plexus

Node-Expansion Operators for the UCT Algorithm,, but so far node expansion has not been investigated. In this paper we show that delaying expansion according to the number of the siblings delivers a gain of more than 92% when compared to normal expansion. We propose three improvements; one that uses domain knowledge and two that are domain-indep

monologue

Resection

粘連

A Human-Computer Team Experiment for 9x9 Go, we have to ask ourselves how can computers make effective use of the ever-increasing computer power. In 2002, we started a human-computer team experiment with very long thinking times and no restrictions on the procedure, to see how strong such a team could be. We will introduce our experimental me