: [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2014'''). ''Small and Large MCTS Playouts applied to Chinese Dark Chess Stochastic Game''. [[ECAI CGW 2014]]
22 KB (2,874 words) - 12:30, 14 March 2022
...dural content generation in creative domains, to investigate ways in which MCTS - typically used for move planning in games - can instead be harnessed to a
7 KB (984 words) - 11:51, 14 March 2022
Most contemporary implementations of MCTS are based on some variant of UCT <ref>[https://en.wikipedia.org/wiki/Monte_
...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
25 KB (3,413 words) - 12:36, 23 October 2020
...nce], Vol. 84, No 1-2</ref>, one distinction between the two might be that MCTS uses usually win/draw/loss scores and Best-First a score from a heuristic [
...63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[Monte-Carlo Tree Search|MCTS]], [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]], [[Bojun Huang#Rollout|
5 KB (720 words) - 10:42, 8 October 2022
...pter/10.1007/978-3-319-57969-6_5 A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta]''. [https://link.springer.com/book/10.1007%2F978-3-319-5796
...63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[Monte-Carlo Tree Search|MCTS]], [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]] <ref>[http://www.talkch
3 KB (394 words) - 09:44, 18 May 2019
...11'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_5 An MCTS Program to Play EinStein Würfelt Nicht!]'' [[Advances in Computer Games 13
* [[Richard J. Lorentz]] ('''2015'''). ''Early Playout Termination in MCTS''. [[Advances in Computer Games 14]]
7 KB (949 words) - 18:38, 13 March 2019
...in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]</ref>.
...n Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/%7Ehayward/papers/mcts-hex.pdf pdf]
10 KB (1,378 words) - 16:25, 1 December 2021
...Müller]], [[Jakub Pawlewicz]] ('''2013'''). ''MoHex 2.0: a pattern-based MCTS Hex player''. [[CG 2013]], [https://webdocs.cs.ualberta.ca/~hayward/papers/
8 KB (1,109 words) - 16:45, 15 October 2019
...MHex · GitHub]</ref>. It was built by a group of students and is based on MCTS with [[UCT|RAVE UCT]]. Along with [[Łukasz Lew]], he applied proof-number
...Müller]], [[Jakub Pawlewicz]] ('''2013'''). ''MoHex 2.0: a pattern-based MCTS Hex player''. [[CG 2013]], [https://webdocs.cs.ualberta.ca/~hayward/papers/
5 KB (730 words) - 18:27, 3 January 2020
...org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
.../abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
16 KB (2,041 words) - 17:22, 16 November 2020
...org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
.../abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
8 KB (1,041 words) - 21:57, 3 November 2020
....org/abs/1512.03375 arXiv:1512.03375] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
...rained_models/writeup.pdf pdf] » [[AlphaZero]], [[Monte-Carlo Tree Search|MCTS]], [[Othello]] <ref>[https://github.com/suragnair/alpha-zero-general GitHub
73 KB (9,313 words) - 12:30, 14 March 2022
...'2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_9 MCTS Experiments on the Voronoi Game]''. [[Advances in Computer Games 13]]
8 KB (1,040 words) - 14:24, 19 February 2019
...). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation: Experiments and shortcuts en-route to
...ctory.co.uk/newsletter/2013_02_unknown_mcts.htm Searching the Unknown with MCTS]''. [[AI Factory]], Winter 2013 » [[Monte-Carlo Tree Search]]
9 KB (1,193 words) - 16:26, 26 July 2018
...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
4 KB (583 words) - 17:45, 3 June 2018
...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
5 KB (682 words) - 18:00, 3 June 2018
...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
8 KB (1,094 words) - 18:01, 3 June 2018
...z]] ('''2011'''). ''UCT-Treesplit - Parallel MCTS on Distributed Memory''. MCTS Workshop, Freiburg, Germany, [http://www.cs.uni-paderborn.de/fileadmin/Info
12 KB (1,523 words) - 16:22, 1 December 2021
...[[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
12 KB (1,508 words) - 15:29, 29 June 2020
...[[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
5 KB (631 words) - 23:41, 23 September 2019
