FEEDBACK Smiley face
Normal view MARC view ISBD view

Advances in Computer Games [electronic resource] :12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers /

Contributor(s): Herik, H. Jaap van den [editor.] | Spronck, Pieter [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 6048Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.Description: XIV, 233 p. 75 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642129933.Subject(s): Computer science | Computer communication systems | Computer programming | Computers | Algorithms | Computer science -- Mathematics | Artificial intelligence | Computer Science | Programming Techniques | Algorithm Analysis and Problem Complexity | Artificial Intelligence (incl. Robotics) | Computation by Abstract Devices | Computer Communication Networks | Discrete Mathematics in Computer ScienceOnline resources: Click here to access online
Contents:
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search -- A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm -- Monte-Carlo Tree Search in Settlers of Catan -- Evaluation Function Based Monte-Carlo LOA -- Monte-Carlo Kakuro -- A Study of UCT and Its Enhancements in an Artificial Game -- Creating an Upper-Confidence-Tree Program for Havannah -- Randomized Parallel Proof-Number Search -- Hex, Braids, the Crossing Rule, and XH-Search -- Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess -- Plans, Patterns, and Move Categories Guiding a Highly Selective Search -- 6-Man Chess and Zugzwangs -- Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K -- Conflict Resolution of Chinese Chess Endgame Knowledge Base -- On Drawn K-In-A-Row Games -- Optimal Analyses for 3×n AB Games in the Worst Case -- Automated Discovery of Search-Extension Features -- Deriving Concepts and Strategies from Chess Tablebases -- Incongruity-Based Adaptive Game Balancing -- Data Assurance in Opaque Computations.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search -- A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm -- Monte-Carlo Tree Search in Settlers of Catan -- Evaluation Function Based Monte-Carlo LOA -- Monte-Carlo Kakuro -- A Study of UCT and Its Enhancements in an Artificial Game -- Creating an Upper-Confidence-Tree Program for Havannah -- Randomized Parallel Proof-Number Search -- Hex, Braids, the Crossing Rule, and XH-Search -- Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess -- Plans, Patterns, and Move Categories Guiding a Highly Selective Search -- 6-Man Chess and Zugzwangs -- Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K -- Conflict Resolution of Chinese Chess Endgame Knowledge Base -- On Drawn K-In-A-Row Games -- Optimal Analyses for 3×n AB Games in the Worst Case -- Automated Discovery of Search-Extension Features -- Deriving Concepts and Strategies from Chess Tablebases -- Incongruity-Based Adaptive Game Balancing -- Data Assurance in Opaque Computations.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in