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

Corporate Author: SpringerLink (Online service)
Other Authors: Herik, H. Jaap van den., Spronck, Pieter.
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series: Lecture Notes in Computer Science, 6048
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-12993-3
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 03124nam a22005655i 4500
001 978-3-642-12993-3
003 DE-He213
005 20170324004131.0
007 cr nn 008mamaa
008 100509s2010 gw | s |||| 0|eng d
020 |a 9783642129933  |9 978-3-642-12993-3 
024 7 |a 10.1007/978-3-642-12993-3  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Advances in Computer Games  |h [electronic resource] :  |b 12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers /  |c edited by H. Jaap van den Herik, Pieter Spronck. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XIV, 233 p. 75 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6048 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer programming. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Herik, H. Jaap van den.  |e editor. 
700 1 |a Spronck, Pieter.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642129926 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6048 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-12993-3 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
999 |c 45310  |d 45310