LEADER 03944nam  22008295  450 
001 996465927103316
005 20230220222813.0
010   $a1-280-38646-0
010   $a9786613564382
010   $a3-642-12993-5
024 7 $a10.1007/978-3-642-12993-3
035   $a(CKB)2550000000011513
035   $a(SSID)ssj0000446241
035   $a(PQKBManifestationID)11293805
035   $a(PQKBTitleCode)TC0000446241
035   $a(PQKBWorkID)10491511
035   $a(PQKB)10349588
035   $a(DE-He213)978-3-642-12993-3
035   $a(MiAaPQ)EBC3065253
035   $a(PPN)149073054
035   $a(EXLCZ)992550000000011513
100   $a20100509d2010      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAdvances in Computer Games$b[electronic resource] $e12th International Conference, ACG 2009, Pamplona, Spain, May 11-13, 2009, Revised Papers /$fedited by H. Jaap van den Herik, Pieter Spronck
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (XIV, 233 p. 75 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6048
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-12992-7 
320   $aIncludes bibliographic references and index.
327   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6048
606   $aComputer programming
606   $aAlgorithms
606   $aArtificial intelligence
606   $aComputer science
606   $aComputer networks
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aProgramming Techniques
606   $aAlgorithms
606   $aArtificial Intelligence
606   $aTheory of Computation
606   $aComputer Communication Networks
606   $aDiscrete Mathematics in Computer Science
607   $aTaipei <2005>$2swd
615  0$aComputer programming.
615  0$aAlgorithms.
615  0$aArtificial intelligence.
615  0$aComputer science.
615  0$aComputer networks.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615 14$aProgramming Techniques.
615 24$aAlgorithms.
615 24$aArtificial Intelligence.
615 24$aTheory of Computation.
615 24$aComputer Communication Networks.
615 24$aDiscrete Mathematics in Computer Science.
676   $a794.81526
702   $avan den Herik$b H. Jaap$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSpronck$b Pieter$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aACG 2009
906   $aBOOK
912   $a996465927103316
996   $aAdvances in Computer Games$92903788
997   $aUNISA