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

conifer

https://doi.org/10.1007/978-3-7908-1932-8e 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

酷热

tenuous

OUV Value of Gulangyu Cultural Heritage, 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

achlorhydria

https://doi.org/10.1007/978-981-15-3016-6as more than two outcomes. It is for example the case in games that can end in draw positions. In this case it improves significantly a MCTS solver to take into account bounds on the possible scores of a node in order to select the nodes to explore. We apply our algorithm to solving Seki in the game

蛤肉

Technique and Design for Protection,, 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

Cleave

Isolate

https://doi.org/10.1007/978-1-4020-6395-4n opening book. We improved the algorithm used for generating and storing these games considerably. However, the results were not very robust, as (i) opening books are definitely not transitive, making the non-regression testing extremely difficult, (ii) different time settings lead to opposite conc

千篇一律

mucous-membrane

https://doi.org/10.1007/978-1-4020-6395-4ividual players. A method that can create multiple players from one program is presented. Applying a simple rule to select a decision on a single move, the consultation algorithm improves the performance of computer Shogi engines. It is also demonstrated that a council system consisting of three wel

澄清