MCTS with Information Sharing
| Thesis title in Czech: | MCTS with Information Sharing |
|---|---|
| Thesis title in English: | MCTS with Information Sharing |
| Key words: | Herní stromy, Minimax, Monte Carlo stromové vyhledávání, Go |
| English key words: | Game Trees, Minimax, Monte Carlo Tree Search, Go |
| Academic year of topic announcement: | 2009/2010 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Department of Theoretical Computer Science and Mathematical Logic (32-KTIML) |
| Supervisor: | RNDr. Jan Hric |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 24.11.2009 |
| Date of assignment: | 24.11.2009 |
| Date and time of defence: | 05.09.2011 09:00 |
| Date of electronic submission: | 03.08.2011 |
| Date of submission of printed version: | 05.08.2011 |
| Date of proceeded defence: | 05.09.2011 |
| Opponents: | Mgr. Vladan Majerech, Dr. |
| Guidelines |
| This thesis will explore possibilities to extend Monte Carlo Tree Search (MCTS)
techniques used in computer go programs. The current methods of search are weak in tactical situations and play suboptimally when a position has big advantage (e.g. beginning of handicap games). Possible reason is that used playouts (i.e. simulations) usually share and propagate only limited amount of information. The work suggests and tests domain specific (for computer go) or general possibilities of information sharing among tree branches, which can improve playing strength. Such information can be based on patterns, sequences, history, results and final position. |
| References |
| Sylvain Gelly, Yizao Wang, Rémi Munos, Olivier Teytaud: Modification of UCT with patterns in Monte-Carlo Go. TR 6062, INRIA, France, 2006
Sylvain Gelly, David Silber: Combining online and offline knowlegde in uct, Proc. ICML'07, ACM, New York, NY, USA, pp. 273-280 |