000772599 000__ 02850cam\a2200541Mi\4500
000772599 001__ 772599
000772599 005__ 20230306142547.0
000772599 006__ m\\\\\o\\d\\\\\\\\
000772599 007__ cr\nn\nnnunnun
000772599 008__ 161209s2016\\\\gw\a\\\\o\\\\\000\0\eng\d
000772599 019__ $$a968243855
000772599 020__ $$a9783319509358
000772599 020__ $$a3319509357
000772599 020__ $$z9783319509341
000772599 0247_ $$a10.1007/978-3-319-50935-8$$2doi
000772599 035__ $$aSP(OCoLC)ocn971054906
000772599 035__ $$aSP(OCoLC)971054906$$z(OCoLC)968243855
000772599 040__ $$aUPM$$beng$$epn$$cUPM$$dOCLCO$$dGW5XE$$dYDX$$dAZU$$dOCLCF$$dOCLCQ
000772599 049__ $$aISEA
000772599 050_4 $$aQA76.9.A43
000772599 08204 $$a005.1$$223
000772599 24500 $$aComputers and Games :$$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.
000772599 264_1 $$aCham :$$bSpringer International Publishing :$$bImprint :$$bSpringer,$$c2016.
000772599 300__ $$a1 online resource (xx, 225 pages) :$$billustrations.
000772599 336__ $$atext$$btxt$$2rdacontent
000772599 337__ $$acomputer$$bc$$2rdamedia
000772599 338__ $$aonline resource$$bcr$$2rdacarrier
000772599 347__ $$atext file$$bPDF$$2rda
000772599 4901_ $$aLecture Notes in Computer Science,$$x0302-9743 ;$$v10068
000772599 5050_ $$aMonte Carlo Tree Search -- Concrete Games -- Theory and Complexity -- Cognition Model.
000772599 506__ $$aAccess limited to authorized users.
000772599 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.
000772599 650_0 $$aComputer science.
000772599 650_0 $$aComputer networks.
000772599 650_0 $$aSoftware engineering.
000772599 650_0 $$aAlgorithms.
000772599 650_0 $$aArtificial intelligence.
000772599 650_0 $$aComputer graphics.
000772599 650_0 $$aImage processing.
000772599 7001_ $$aPlaat, Aske,$$eeditor.
000772599 7001_ $$aKosters, Walter,$$eeditor.
000772599 7001_ $$aVan den Herik, Jaap,$$eeditor.
000772599 77608 $$iPrint version:$$z9783319509341
000772599 830_0 $$aLecture notes in computer science ;$$v10068.$$x0302-9743
000772599 852__ $$bebk
000772599 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-50935-8$$zOnline Access$$91397441.1
000772599 909CO $$ooai:library.usi.edu:772599$$pGLOBAL_SET
000772599 980__ $$aEBOOK
000772599 980__ $$aBIB
000772599 982__ $$aEbook
000772599 983__ $$aOnline
000772599 994__ $$a92$$bISE