000 03590nam a22005535i 4500
001 978-3-642-12993-3
003 DE-He213
005 20140220084536.0
007 cr nn 008mamaa
008 100509s2010 gw | s |||| 0|eng d
020 _a9783642129933
_9978-3-642-12993-3
024 7 _a10.1007/978-3-642-12993-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aHerik, H. Jaap.
_eeditor.
245 1 0 _aAdvances in Computer Games
_h[electronic resource] :
_b12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers /
_cedited by H. Jaap Herik, Pieter Spronck.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIV, 233p. 75 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6048
505 0 _aAdding 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.
520 _aThis volume constitutes the thoroughly refereed post-conference proceedings of the Twelfth Advances in Computer Games Conference, ACG 2009, held in Pamplona, Spain, in May 2009. The 20 revised full papers presented were carefully reviewed and selected from 41 submissions for inclusion in the book. The topics addressed contain Monte-Carlo tree search, Bayesian modeling, selective search, brute force, conflict resolution, solving games, optimization, concept discovery, incongruity theory, and data assurance.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aComputer Communication Networks.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aSpronck, Pieter.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642129926
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6048
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-12993-3
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112172
_d112172