Advances in Computer Games: 14th International Conference, by Aske Plaat, Jaap van den Herik, Walter Kosters

By Aske Plaat, Jaap van den Herik, Walter Kosters

This publication constitutes the completely refereed post-conference lawsuits of the 14th overseas convention on Advances in desktop video games, ACG 2015, held in Leiden, The Netherlands, in July 2015.

Show description

Read Online or Download Advances in Computer Games: 14th International Conference, ACG 2015, Leiden, The Netherlands, July 1-3, 2015, Revised Selected Papers PDF

Best structured design books

Research Issues in Systems Analysis and Design, Databases and Software Development

New suggestions corresponding to agile modeling, severe programming, wisdom administration, and organizational reminiscence are stimulating new study rules between researchers, and prompting new purposes and software program. Revolution and evolution are universal within the parts of data platforms improvement and database.

Reshaping Your Business with Web 2.0

Combine internet 2. zero traits and applied sciences into the firm Written via a workforce of specialists from the net 2. zero neighborhood and Oracle company, this cutting edge advisor offers a blueprint for leveraging the recent tradition of participation in an firm environment. Reshaping your corporation with net 2. zero deals confirmed suggestions for the winning adoption of an company 2.

Advances in Intelligent Data Analysis IX: 9th International Symposium, IDA 2010, Tucson, AZ, USA, May 19-21, 2010. Proceedings

This booklet constitutes the refereed complaints of the ninth overseas convention on clever information research, IDA 2010, held in Tucson, AZ, united states in might 2010. The 21 revised papers awarded including 2 invited papers have been rigorously reviewed and chosen from greater than forty submissions. All present facets of clever information research are addressed, quite clever aid for modeling and examining complicated, dynamical structures.

Conceptual Data Modeling and Database Design. A Fully Algorithmic Approach. The Shortest Advisable Path

This new booklet goals to supply either rookies and specialists with a very algorithmic method of info research and conceptual modeling, database layout, implementation, and tuning, ranging from imprecise and incomplete consumer requests and finishing with IBM DB/2, Oracle, MySQL, MS SQL Server, or entry dependent software program functions.

Additional resources for Advances in Computer Games: 14th International Conference, ACG 2015, Leiden, The Netherlands, July 1-3, 2015, Revised Selected Papers

Example text

Intell. AI Games 4(1), 1–43 (2012) 3. : Nested Monte-Carlo search. In: Boutilier, C. ) IJCAI, pp. 456– 461 (2009) 4. : Sequential halving applied to trees. IEEE Trans. Comput. Intell. AI Games 7(1), 102–105 (2015) 5. : Discounting and pruning for nested playouts in general game playing. GIGA at IJCAI (2015) 6. : Revisiting Monte-Carlo tree search on a normal form game: NoGo. , et al. ) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 73–82. Springer, Heidelberg (2011) 7. : Efficient selectivity and backup operators in Monte-Carlo tree search.

The difference with UCT is that in the playouts PPA has a weight for each possible move and chooses randomly between possible moves proportionally to the exponential of the weight. 22 T. Cazenave In the beginning PPA starts with a uniform playout policy. All the weights are set to zero. Then, after each playout, it adapts the policy of the winner of the playout. The principle is the same as the adaptation of NRPA except that it only adapts the policy of the winner of the playout with the moves of the winner.

Why would fewer random moves in a playout hinder performance? Observational evidence suggests it boils down to a trade off between the advantages of a deep evaluation and disadvantages of losing information from the randomness of a playout. In general, an evaluation near the end of the game is more reliable than one earlier on but after too many random moves a position may lose the essence of the starting position. We search for a happy medium where a few random moves take us closer to the end of the game, without having the random moves degrade the information too much.

Download PDF sample

Rated 4.16 of 5 – based on 23 votes