Changes

Jump to: navigation, search

UCT

2,082 bytes added, 12:36, 23 October 2020
no edit summary
* [[Damien Pellier]], [[Bruno Bouzy]], [[Marc Métivier]] ('''2010'''). ''An UCT Approach for Anytime Agent-based Planning''. [http://www.springer.com/de/book/9783642123832 PAAMS'10], [http://www.mi.parisdescartes.fr/~bouzy/publications/pellier-bouzy-metivier-paams10.pdf pdf]
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-based reinforcement learning.'' [[AAAI]], [https://pdfs.semanticscholar.org/bdc9/bfb6ecc6fb5afb684df03d7220c46ebdbf4e.pdf pdf] » [[Reinforcement Learning]]
* [[Takayuki Yajima]], [[Tsuyoshi Hashimoto]], [[Toshiki Matsui]], [[Junichi Hashimoto]], [[Kristian Spoerer]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007%2F978-3-642-17928-0_11 Node-Expansion Operators for the UCT Algorithm]''. [[CG 2010]]
'''2011'''
* [[Junichi Hashimoto]], [[Akihiro Kishimoto]], [[Kazuki Yoshizoe]], [[Kokolo Ikeda]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_1 Accelerated UCT and Its Application to Two-Player Games]''. [[Advances in Computer Games 13]]
* [[Raghuram Ramanujan]], [[Bart Selman]] ('''2011'''). ''[http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2708 Trade-Offs in Sampling-Based Adversarial Planning]''. [http://www.aaai.org/Press/Proceedings/icaps11.php ICAPS 2011]
* [[Christopher D. Rosin]] ('''2011'''). ''[https://link.springer.com/article/10.1007/s10472-011-9258-6 Multi-armed bandits with episode context]''. Annals of Mathematics and Artificial Intelligence, Vol. 61, No. 3, [http://gauss.ececs.uc.edu/Workshops/isaim2010/papers/rosin.pdf ISAIM 2010 pdf] » [[Christopher D. Rosin#PUCT|PUCT]]
* [[Adrien Couëtoux]], [[Jean-Baptiste Hoock]], [[Nataliya Sokolovska]], [[Olivier Teytaud]], [[Nicolas Bonnard]] ('''2011'''). ''Continuous Upper Confidence Trees''. [https://dblp.uni-trier.de/db/conf/lion/lion2011.html LION 2011], [https://hal.archives-ouvertes.fr/hal-00542673v1/document pdf]
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2011'''). ''Doing Better Than UCT: Rational Monte Carlo Sampling in Trees''. [https://arxiv.org/abs/1108.3711 arXiv:1108.3711]
'''2012'''
* [[Oleg Arenz]] ('''2012'''). ''Monte Carlo Chess''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf] » [[Stockfish]]
* [[Cameron Browne]], [[Edward Powley]], [[Daniel Whitehouse]], [[Simon Lucas]], et al. [[Peter Cowling]], [[Philipp Rohlfshagen]], [[Stephen Tavener]], [[Diego Perez]], [[Spyridon Samothrakis]], [[Simon Colton]] ('''2012'''). ''[httphttps://ieeexplore.ieee.org/xpldocument/login.jsp?tp=&arnumber=6145622&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F4804728%2F6169178%2F06145622.pdf%3Farnumber%3D6145622 A Survey of Monte Carlo Tree Search Methods]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 4, No. 1, [http://wwwccg.doc.cameroniusgold.comac.uk/ccg_old/cvpapers/mcts-survey-masterbrowne_tciaig12_1.pdf pdf]
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
* [[Adrien Couetoux]], [[Olivier Teytaud]], [[Hassen Doghmen]] ('''2012'''). ''Learning a Move-Generator for Upper Confidence Trees''. [http://ics2012.ndhu.edu.tw/ ICS 2012], [https://en.wikipedia.org/wiki/Hualien_City Hualien], [https://en.wikipedia.org/wiki/Taiwan Taiwan], December 2012 » [[Learning]], [[Move Generation]]
* [[Ashish Sabharwal]], [[Horst Samulowitz]], [[Chandra Reddy]] ('''2012'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-29828-8_23 Guiding Combinatorial Optimization with UCT]''. [http://dblp.uni-trier.de/db/conf/cpaior/cpaior2012.html#SabharwalSR12 CPAIOR 2012], [http://web.emn.fr/x-info/cpaior-2012/uploads/Abstracts/CPAIOR%20-%2072980356.pdf abstract as pdf], [http://www.cs.toronto.edu/~horst/cogrobo/papers/uctmip.pdf draft as pdf]
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2012'''). ''Understanding Sampling Style Adversarial Search Methods''. [http://arxiv.org/abs/1203.4011 arXiv:1203.4011]
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Chang-Shing Lee]], [[David L. Saint-Pierre]], [[Olivier Teytaud]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2012'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
* [[Arthur Guez]], [[David Silver]], [[Peter Dayan]] ('''2012'''). ''Efficient Bayes-Adaptive Reinforcement Learning using Sample-Based Search''. [https://arxiv.org/abs/1205.3109 arXiv:1205.3109]
* [[Truong-Huy Dinh Nguyen]], [[Wee Sun Lee]], [[Tze-Yun Leong]] ('''2012'''). ''Bootstrapping Monte Carlo Tree Search with an Imperfect Heuristic''. [https://arxiv.org/abs/1206.5940 arXiv:1206.5940]
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''MCTS Based on Simple Regret''. [[Conferences#AAAI-2012|AAAI-2012]], [https://arxiv.org/abs/1207.5536 arXiv:1207.5536]
'''2013'''
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Chang-Shing Lee]], [[David L. Saint-Pierre]], [[Olivier Teytaud]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2013'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI|TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
* [[Simon Viennot]], [[Kokolo Ikeda]] ('''2013'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-09165-5_3 Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search]''. [[CG 2013]]
* [[Rui Li]], [[Yueqiu Wu]], [[Andi Zhang]], [[Chen Ma]], [[Bo Chen]], [[Shuliang Wang]] ('''2013'''). ''[http://cpfd.cnki.com.cn/Article/CPFDTOTAL-KZJC201309001170.htm Technique Analysis and Designing of Program with UCT Algorithm for NoGo]''. [http://www.ccdc.neu.edu.cn/CCDC2013/ CCDC2013]
* [[David W. King]] ('''2014'''). ''Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas''. Masters thesis, [https://en.wikipedia.org/wiki/Air_Force_Institute_of_Technology Air Force Institute of Technology], [http://www.afit.edu/docs/AFIT-ENG-14-M-44_King.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Crossings_%28game%29 Crossings from Wikipedia]</ref>
* [[David W. King]], [[Gilbert L. Peterson]] ('''2014'''). ''Epaminondas: Exploring Combat Tactics''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] <ref> [https://en.wikipedia.org/wiki/Epaminondas_%28game%29 Epaminondas from Wikipedia]</ref>
* [[Truong-Huy Dinh Nguyen]], [[Tomi Silander]], [[Wee Sun Lee]], [[Tze-Yun Leong]] ('''2014'''). ''[https://www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7934 Bootstrapping Simulation-Based Algorithms with a Suboptimal Policy]''. [https://dblp.uni-trier.de/db/conf/aips/icaps2014.html ICAPS 2014], [https://youtu.be/ccwcZZj5vKM YouTube Video]
==2015 ...==
* [[Xi Liang]], [[Ting-Han Wei]], [[I-Chen Wu]] ('''2015'''). ''Job-level UCT search for solving Hex''. [http://dblp.uni-trier.de/db/conf/cig/cig2015.html#LiangWW15 CIG 2015]
* [[Xi Liang]], [[Ting-Han Wei]], [[I-Chen Wu]] ('''2015'''). ''Solving Hex Openings Using Job-Level UCT Search''. [[ICGA Journal#38_3|ICGA Journal, Vol. 38, No. 3]]
* [[Naoki Mizukami]], [[Jun Suzuki]], [[Hirotaka Kameko]], [[Yoshimasa Tsuruoka]] ('''2017'''). ''Exploration Bonuses Based on Upper Confidence Bounds for Sparse Reward Games''. [[Advances in Computer Games 15]]
* [[Jacek Mańdziuk]] ('''2018'''). ''MCTS/UCT in Solving Real-Life Problems''. [https://www.springer.com/us/book/9783319679457 Advances in Data Analysis with Computational Intelligence Methods], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Kiminori Matsuzaki]] ('''2018'''). ''Empirical Analysis of PUCT Algorithm with Evaluation Functions of Different Quality''. [[TAAI 2018]]
=Forum Posts=
==2010 ...==
* [http://computer-go.org/pipermail/computer-go/2010-June/000376.html Re: Chess vs Go // AI vs IA] by [[Gian-Carlo Pascutto]], June 02, 2010
* [http://www.lifein19x19.com/forum/viewtopic.php?f=18&t=2184 Monte Carlo (upper confidence bounds applied to trees)] by ChessGO, [http://www.lifein19x19.com/forum/viewforum.php?f=18 Computer Go], October 22, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=42590 uct on gpu] by [[Daniel Shawul]], [[CCC]], February 24, 2012 » [[GPU]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50721 My new book] by [[Daniel Shawul]], [[CCC]], January 02, 2014 » [[Opening Book]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=65964 Nebiyu-MCTS vs TSCP 1-0] by [[Daniel Shawul]], [[CCC]], December 10, 2017 » [[Nebiyu]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017 » [[Raghuram Ramanujan#UCT|Sampling-Based Planning]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=32429 MCTS weakness wrt AB (via Daniel Shawul)] by [[Chris Whittington]], [[Computer Chess Forums|Rybka Forum]], December 25, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=66280 Announcing lczero] by [[Gary Linscott|Gary]], [[CCC]], January 09, 2018 » [[Leela Chess Zero]]
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=75484 uct algorithm bad at chess?] by Ofek Shochat, [[CCC]], October 21, 2020
=External Links=
* [https://en.wikipedia.org/wiki/Confidence_interval Confidence interval from Wikipedia]
* [https://en.wikipedia.org/wiki/Multi-armed_bandit Multi-armed bandit from Wikipedia]
* [httphttps://mctsgithub.aicom/abouttheKGS/index.html Monte Carlo Tree Search] by [[Cameron Browne]] et al.MCTS GitHub - theKGS/MCTS: [http://mcts.ai/code/python.html Java implementation of UCT Monte Carlo Tree Search algorithm] in [[Python|Python 2.7]] by [[Peter Cowling]], [[Ed Powley]], based MCTS and [[Daniel Whitehouse]]: [http://mcts.ai/code/java.html UCT Flat MCTS implementation] in [[Java]] by [[Simon Lucas]]* [httphttps://senseis.xmp.net/?UCT Sensei's Library: UCT]* [httphttps://www.althofer.de/lange-nacht-jena.html Lange Nacht der Wissenschaften - Long Night of Sciences Jena - 2007] by [[Ingo Althöfer]], [[Jakob Erdmann#UCT|MC and UCT poster]] by [[Jakob Erdmann]]
* [[:Category:Weather Report|Weather Report]] - [https://en.wikipedia.org/wiki/Sweetnighter Boogie Woogie Waltz], 1974, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[:Category:Joe Zawinul|Joe Zawinul]], [[:Category:Wayne Shorter|Wayne Shorter]], [[:Category:Alphonso Johnson|Alphonso Johnson]], [https://www.allmusic.com/artist/darryl-brown-mn0001213839 Darryl Brown], [[:Category:Dom Um Romão|Dom Um Romão]]
'''[[Monte-Carlo Tree Search|Up one level]]'''
[[Category:Quotes]]
[[Category:Weather Report]]
[[Category:Alphonso Johnson]]

Navigation menu