Search results

• 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
• Chess Fighter
  ...based on the ideas of [[AlphaZero]], and applies [[Monte-Carlo Tree Search|MCTS]]/[[Christopher D. Rosin#PUCT|PUCT]] along with 8x128 value and policy nets
  2 KB (256 words) - 21:14, 24 August 2020
• TCEC Season 17
  | [[Komodo#MCTS|Komodo MCTS]] | [[Komodo#MCTS|KomodoMCTS 2484.00]]
  71 KB (7,149 words) - 09:52, 7 October 2021
• Warren D. Smith
  ...th the advent of [[Deep Learning|deep learning]] [[Monte-Carlo Tree Search|MCTS]] chess engines after the [[AlphaZero]] publications, Warren D. Smith contr
  18 KB (2,460 words) - 22:23, 14 June 2021
• Solomon Eyal Shimony
  ...nd [[UCT]] <ref>[[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''MCTS Based on Simple Regret''. [[Conferences#AAAI-2012|AAAI-2012]], [https://arx * [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''MCTS Based on Simple Regret''. [[Conferences#AAAI-2012|AAAI-2012]], [https://arx
  8 KB (1,020 words) - 12:26, 15 May 2020
• SugaR
  * [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70295 SugaR MCTS Learning (New)] by supersharp77, [[CCC]], March 24, 2019
  5 KB (686 words) - 12:09, 18 May 2020
• Stephane Nicolet
  ...cember 06, 2017 » [[Stockfish]], [[AlphaZero]], [[Monte-Carlo Tree Search|MCTS]]
  9 KB (1,173 words) - 10:33, 25 June 2021
• David E. Moriarty
  ...he research was conducted a few years before the [[Monte-Carlo Tree Search|MCTS]] revolution appeared in computer Go, not to mention the [[Deep Learning|de
  5 KB (744 words) - 12:26, 15 July 2020
• Simon Lucas
  ...s://ieeexplore.ieee.org/document/6932868 Knowledge-based fast evolutionary MCTS for general video game playing]''. [[IEEE#CIG|IEEE CIG 2014]], [http://www.
  10 KB (1,373 words) - 13:25, 17 July 2020
• A0lite
  1. Teaching other people how simple it is to write a basic mcts/nn engine with a0lite python. 3. Combining ab/nnue and mcts/nn in a hybrid approach. (Was a0lite julia, renamed Bender)
  4 KB (575 words) - 04:08, 16 August 2022
• Stuart Riffle
  ...>[https://github.com/StuartRiffle/Jaglavak GitHub - StuartRiffle/Jaglavak: MCTS chess engine for GPU and SIMD]</ref>, both targeting [[SIMD and SWAR Techni
  3 KB (444 words) - 16:22, 26 August 2020

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