Implementation And Experimentation of Coherent Inference in Game Tree
Examensarbete för masterexamen
Please use this identifier to cite or link to this item:
There are no files associated with this item.
|Type: ||Examensarbete för masterexamen|
|Title: ||Implementation And Experimentation of Coherent Inference in Game Tree|
|Authors: ||Liu, Pengkun|
|Abstract: ||The game tree problem has been a focal and intriguing area for decades; people are fascinated by the idea that a computer could have rational thought. In 1950, Shannon's paper presents a simplified mathematical procedure enabling a modern computer to play chess, since then a numerous of game tree search algorithms have emerged. Even though great progress has been made, there is no general algorithm that can perform perfectly in complex strategy games like Go. In this thesis, a coherent inference game tree search algorithm showing some potentials in artificial game trees is analyzed in detail.It presents an approximate mechanism to infer off-policy optimal values of nodes in the game tree given on-policy scores from random roll-outs. Theoretical foundation and techniques employed in this algorithm are elaborated. Furthermore, experiments are carried out to examine the performance of this algorithm in real game tree and show its pros and cons.|
|Keywords: ||Data- och informationsvetenskap;Informations- och kommunikationsteknik;Computer and Information Science;Information & Communication Technology|
|Issue Date: ||2015|
|Publisher: ||Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)|
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
|Collection:||Examensarbeten för masterexamen // Master Theses|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.