First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2012-02-26 02:26:19Open Document File Size: 2,35 MBShare Result on FacebookCityBandit / /CompanyRussell / E. Powley / /CountryUnited Kingdom / / /FacilityUniversity of Bradford / Imperial College / University of Essex / /IndustryTermtree search / insights into how other algorithms / decision applications / search approach / unknown law / partial search tree / maxn algorithm / search algorithm / basic algorithm / search iteration / search parameters / iterated local search / minimax search / overall search / tree-based search / game playing algorithms / search tree / numerical algorithms / proposed search method / iteratively building a search tree / /OperatingSystemGNU / /OrganizationImperial College London / School of Computing / Informatics and Media / Department of Computing / University of Essex / School of Computer Science and Electronic Engineering / University of Bradford / /PersonPhilipp Rohlfshagen / Simon Lucas / Xi / ARLO T REE / Daniel Whitehouse / Stephen Tavener / Spyridon Samothrakis / Carlo Tree / Diego Perez / Game Playing / Peter I. Cowling / Simon Colton Abstract / Edward Powley / /Positioncurrent player / champion Hex player / AI researcher / General / Player / Single-Player / puzzle designer / /RadioStationWork 7.2 / /Technology4.2 Bandit Algorithm / specific algorithm / maxn algorithm / 3.1 The UCT algorithm / MCTS algorithm / basic MCTS algorithm / UCT algorithm / 2012 Algorithm / AI game playing algorithms / 2 The UCT algorithm / proposed algorithm / artificial intelligence / 3.1 Algorithm / Monte Carlo search algorithm / simulation / Digital Object Identifier / basic algorithm / be approximated using random simulation / /SocialTag |