Search results

• S. Ali Mirsoleimani
  ...ks on [[Monte-Carlo Tree Search]], [[UCT]], and [[Parallel Search|parallel MCTS]]. ...org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
  7 KB (926 words) - 22:31, 5 March 2019
• Hui Wang
  ...://arxiv.org/abs/1802.05944 arXiv:1802.05944] » [[Monte-Carlo Tree Search|MCTS]], [[Reinforcement Learning]]
  2 KB (237 words) - 12:11, 6 March 2019
• Cheng-Wei Chou
  ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
  7 KB (889 words) - 17:16, 7 March 2019
• Chang-Shing Lee
  ...ture_University OPU], for example, the number of [[Monte-Carlo Tree Search|MCTS]] simulations and winning rate prediction. The proposed robotic prediction ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
  13 KB (1,740 words) - 15:07, 24 October 2019
• Mei-Hui Wang
  ...ture_University OPU], for example, the number of [[Monte-Carlo Tree Search|MCTS]] simulations and winning rate prediction. The proposed robotic prediction ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
  12 KB (1,532 words) - 15:08, 24 October 2019
• Jean-Baptiste Hoock
  ...s://arxiv.org/abs/1607.08100 arXiv:1607.0810] » [[Monte-Carlo Tree Search|MCTS]]
  8 KB (964 words) - 17:45, 6 March 2019
• TAAI 2018
  ...applied to trees]]). The effect of evaluation functions on the strength of MCTS algorithms, however, has not been investigated well, especially in terms of
  8 KB (1,195 words) - 14:09, 28 January 2020
• David J. Wu
  ...ombining [[Deep Learning|Deep learning]] with [[Monte-Carlo Tree Search]] (MCTS) using pure [[Reinforcement Learning|reinforcement learning]] aka self play
  7 KB (940 words) - 22:40, 26 April 2021
• Thomas Dybdahl Ahle
  ...w.talkchess.com/forum3/viewtopic.php?f=7&t=71301&start=8 Re: A question to MCTS + NN experts] by [[Thomas Dybdahl Ahle]], [[CCC]], August 04, 2019
  6 KB (850 words) - 17:25, 17 September 2020
• Albert Silver
  ...ver]], [[ChessBase|ChessBase News]], June 15, 2018 » [[Komodo#MCTS|Komodo MCTS]]
  23 KB (2,811 words) - 08:19, 21 July 2021
• Allie
  [[Category:MCTS]]
  7 KB (920 words) - 20:31, 24 February 2021
• Deus X
  [[Category:MCTS]]
  9 KB (1,264 words) - 12:37, 13 February 2021
• TCEC Season 14
  ...r [[#disqualificationKomodoMCTS|disqualification]] of [[Komodo#MCTS|Komodo MCTS]]</ref> | [[Komodo#MCTS|Komodo MCTS]]
  42 KB (4,116 words) - 09:51, 7 October 2021
• TCEC Season 15
  | [[Komodo#MCTS|Komodo MCTS]] | [[Komodo#MCTS|KomodoMCTS 2301.00]]
  52 KB (5,464 words) - 09:51, 7 October 2021
• TCEC Season 16
  | [[Komodo#MCTS|Komodo MCTS]] | [[Komodo#MCTS|Komodo MCTS 2381.00]]
  67 KB (6,787 words) - 09:51, 7 October 2021
• Yen-Chi Chen
  =Exact-Win-MCTS=
  3 KB (429 words) - 12:32, 16 January 2021
• Yu-Heng Chen
  ...h [[Shun-Shii Lin]] et al. on improvements in [[Monte-Carlo Tree Search]] (MCTS), ...ipedia.org/wiki/Connection_game connection games]) proposing a [[Minimax]] MCTS hybrid <ref>[[Shun-Shii Lin]], [[Chih-Hung Chen]], [[Yu-Heng Chen]], [[Wei-
  1 KB (155 words) - 16:42, 15 October 2019
• Chia-Hsiu Kao
  ...ture_University OPU], for example, the number of [[Monte-Carlo Tree Search|MCTS]] simulations and winning rate prediction. The proposed robotic prediction
  3 KB (487 words) - 14:46, 24 October 2019
• Fat Fritz
  ...ombining [[Deep Learning|Deep learning]] with [[Monte-Carlo Tree Search]] (MCTS) <ref>[[David Silver]], [[Thomas Hubert]], [[Julian Schrittwieser]], [[Ioan [[Category:MCTS]]
  23 KB (3,070 words) - 07:21, 15 December 2022
• Martin Fierz
  * [http://www.talkchess.com/forum/viewtopic.php?t=67235 MCTS beginner questions] by [[Martin Fierz]], [[CCC]], April 25, 2018 » [[Monte * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=67302 MCTS with minmax backup operator?] by [[Martin Fierz]], [[CCC]], May 01, 2018
  9 KB (1,138 words) - 22:11, 3 November 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)