Search results

• 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
• Jaglavak
  Unlike Pigeon, Jaglavak performs a [[Monte-Carlo Tree Search|MCTS]] and uses the [[UCT]] formula to guide the selection of a node. * [https://github.com/StuartRiffle/Jaglavak GitHub - StuartRiffle/Jaglavak: MCTS chess engine for GPU and SIMD]
  3 KB (437 words) - 21:19, 9 September 2020
• Maksim Korzh
  ...]], [[CCC]], July 17, 2019 » [[Deep Learning]], [[Monte-Carlo Tree Search|MCTS]]
  8 KB (1,085 words) - 20:41, 8 November 2021
• FastChess
  ...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 [[Category:MCTS]]
  3 KB (448 words) - 13:56, 30 May 2021
• Bojun Guo
  ...rum3/viewtopic.php?f=7&t=66886&start=1 Re: comparing minimax and averaging MCTS with alphabeta rollouts] by [[Bojun Guo]], [[CCC]], March 20, 2018 » [[Mon
  5 KB (708 words) - 01:13, 13 January 2022
• Kai Laskos
  ..., October 23, 2016 » [[Deep Learning]], [[Go]], [[Monte-Carlo Tree Search|MCTS]] * [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68875 Komodo MCTS scales worse with TC than Komodo A/B?] by [[Kai Laskos]], [[CCC]], November
  16 KB (2,141 words) - 23:40, 2 December 2020
• Dragon by Komodo Chess
  ...r classical [[Alpha-Beta|alpha-beta]] as well as [[Monte-Carlo Tree Search|MCTS]]. [[Category:MCTS]]
  7 KB (907 words) - 12:31, 11 October 2023
• Explorer
  ...rlo_tree_search#Exploration_and_exploitation Exploration and exploitation (MCTS) from Wikipedia]
  2 KB (343 words) - 11:01, 23 December 2020
• Ceres
  Ceres provides an [[Monte-Carlo Tree Search|MCTS]] implementation with many novel algorithmic improvements and low level opt * [https://github.com/dje-dev/Ceres GitHub - dje-dev/Ceres: Ceres - an MCTS chess engine for research and recreation]
  5 KB (669 words) - 23:02, 9 February 2021
• Gareth Pearce
  Actually he works on back-porting [[Ceres|Ceres']] [[Monte-Carlo Tree Search|MCTS]] algorithmic improvements to [[Leela Chess Zero#Lc0|Lc0]], such as the par
  2 KB (229 words) - 10:45, 16 January 2021
• Fabien Teytaud
  ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]] ...[Julien Dehos]] ('''2015'''). ''On the Tactical and Strategic Behaviour of MCTS when Biasing Random Simulations''. [[ICGA Journal#38_2|ICGA Journal, Vol. 3
  7 KB (916 words) - 12:31, 14 March 2022

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