000 03880nam a22006495i 4500
001 978-3-319-50935-8
003 DE-He213
005 20210120143337.0
007 cr nn 008mamaa
008 161209s2016 gw | s |||| 0|eng d
020 _a9783319509358
_9978-3-319-50935-8
024 7 _a10.1007/978-3-319-50935-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a005.1
_223
245 1 0 _aComputers and Games
_h[electronic resource] :
_b9th International Conference, CG 2016, Leiden, The Netherlands, June 29 – July 1, 2016, Revised Selected Papers /
_cedited by Aske Plaat, Walter Kosters, Jaap van den Herik.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXX, 225 p. 68 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v10068
_aLecture Notes in Computer Science
_v10068
505 0 _aMonte Carlo Tree Search -- Concrete Games -- Theory and Complexity -- Cognition Model.
520 _aThis book constitutes the thoroughly refereed post-conference proceedings of the 9th International Conference on Computers and Games, CG 2016, held in Leiden, The Netherlands,in conjunction with the 19th Computer Olympiad and the 22nd World Computer-Chess Championship. The 20 papers presented were carefully reviewed and selected of 30 submitted papers. The 20 papers cover a wide range of computer games and many different research topics in four main classes which determined the order of publication: Monte Carlo Tree Search (MCTS) and its enhancements (seven papers), concrete games (seven papers), theoretical aspects and complexity (five papers) and cognition model (one paper). The paper Using Partial Tablebases in Breakthrough by Andrew Isaac and Richard Lorentz received the Best Paper Award.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 0 _aComputer communication systems.
650 0 _aComputer graphics.
650 0 _aOptical data processing.
650 1 4 _aAlgorithm Analysis and Problem Complexity.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 2 4 _aArtificial Intelligence.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I21000
650 2 4 _aSoftware Engineering.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14029
650 2 4 _aComputer Communication Networks.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I13022
650 2 4 _aComputer Graphics.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I22013
650 2 4 _aImage Processing and Computer Vision.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I22021
700 1 _aPlaat, Aske.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKosters, Walter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _avan den Herik, Jaap.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319509341
776 0 8 _iPrinted edition:
_z9783319509365
830 0 _aTheoretical Computer Science and General Issues ;
_v10068
830 0 _aLecture Notes in Computer Science ;
_v10068
856 4 0 _uhttps://doi.org/10.1007/978-3-319-50935-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57652
_d57652