Search results

Jump to: navigation, search

  • Engines
    * [[:Category:MCTS]]
    33 KB (3,508 words) - 02:43, 20 October 2022
  • Dictionary
    * [[Monte-Carlo Tree Search|MCTS]] - Monte-Carlo Tree Search
    10 KB (1,192 words) - 22:14, 18 November 2020
  • Stockfish
    * [https://groups.google.com/d/msg/fishcooking/rMCfc8zMerc/F01WuNtDCgAJ MCTS wrapper for StockFish] by [[Jonathan Baxter]], [[Computer Chess Forums|Fish
    65 KB (8,362 words) - 13:19, 1 March 2024
  • Leela Chess Zero
    ...learning]] along with [[Monte-Carlo Tree Search|Monte-Carlo tree search]] (MCTS) techniques of [[AlphaZero]] as described in [[DeepMind|DeepMind's]] 2017 a ...xecutable, the actual chess engine, performs the [[Monte-Carlo Tree Search|MCTS]] and reads the self-taught [[Neural Networks#Convolutional|CNN]], which we
    35 KB (4,831 words) - 15:09, 10 August 2023
  • Monte-Carlo Tree Search
    '''Monte Carlo Tree Search''', (Monte-Carlo Tree Search, MCTS)<br/> ...in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]</ref>, [[Checkers]] <ref>[http://www.talkchess.com/forum/viewt
    76 KB (10,188 words) - 16:36, 1 December 2021
  • Alpha-Beta
    ...63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[Monte-Carlo Tree Search|MCTS]], [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]], [[Bojun Huang#Rollout| ...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
    37 KB (5,099 words) - 16:20, 1 December 2021
  • Principal Variation
    ...2019 » [[Principal Variation#MultiPV|MultiPV]], [[Monte-Carlo Tree Search|MCTS]]
    16 KB (2,278 words) - 16:45, 3 November 2020
  • Jaap van den Herik
    ...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]]
    62 KB (8,279 words) - 13:30, 17 November 2021
  • SSS* and Dual*
    ...[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]], [[Monte-Carlo Tree Search|MCTS]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: A
    18 KB (2,480 words) - 23:49, 9 March 2019
  • Parallel Search
    ...z]] ('''2011'''). ''UCT-Treesplit - Parallel MCTS on Distributed Memory''. MCTS Workshop, Freiburg, Germany, [http://www.cs.uni-paderborn.de/fileadmin/Info ...rg/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]], [[x86-64]]
    86 KB (11,607 words) - 18:34, 11 November 2021
  • ICGA Journal
    ...Monte Carlo tree search''. » [[Deep Learning]], [[Monte-Carlo Tree Search|MCTS]] ...Carlo tree search?'' [[CG 2018]] » [[Othello]], [[Monte-Carlo Tree Search|MCTS]]
    173 KB (22,418 words) - 20:37, 6 April 2022
  • Evaluation
    ...). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation]''. [[AI Factory]], Winter 2011 » [[Mo
    36 KB (4,737 words) - 09:34, 9 September 2021
  • Playing Strength
    ...[[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
    54 KB (7,310 words) - 11:16, 4 April 2022
  • B*
    * [http://www.talkchess.com/forum/viewtopic.php?t=41730 MCTS without random playout?] by [[Antonio Torrecillas]], [[CCC]], January 01, 2
    12 KB (1,908 words) - 00:50, 8 December 2020
  • GUI
    * [http://talkchess.com/forum3/viewtopic.php?t=74891 "New" Engines (lc0, MCTS, SFNNUE) and suitable GUIs] by Hamster, [[CCC]], August 25, 2020
    21 KB (3,097 words) - 04:02, 7 June 2022
  • X86-64
    ...en]] ('''2014'''). ''Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi''. [http://arxiv.org/abs/1409.4297 CoRR ab .../abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]]
    18 KB (2,422 words) - 15:11, 11 October 2023
  • Reinforcement Learning
    ...://arxiv.org/abs/1802.05944 arXiv:1802.05944] » [[Monte-Carlo Tree Search|MCTS]], [[General Game Playing]]
    54 KB (7,025 words) - 12:47, 14 March 2022
  • Neural Networks
    ...[[Neural Networks#Deep|Deep Learning]], [[Go]], [[Monte-Carlo Tree Search|MCTS]] * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71301 A question to MCTS + NN experts] by [[Maksim Korzh]], [[CCC]], July 17, 2019 » [[Monte-Carlo
    156 KB (21,084 words) - 18:34, 12 March 2022
  • Advances in Computer Games 13
    ...11'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_5 An MCTS Program to Play EinStein Würfelt Nicht!]'' ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''.
    9 KB (1,164 words) - 14:05, 28 January 2020
  • Advances in Computer Games 14
    * [[Richard J. Lorentz]] ('''2015'''). ''Early Playout Termination in MCTS''. [[Advances in Computer Games 14]] ...[[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
    6 KB (790 words) - 14:05, 28 January 2020
  • CG 2013
    ...Müller]], [[Jakub Pawlewicz]] ('''2013'''). ''MoHex 2.0: a pattern-based MCTS Hex player''. [[CG 2013]], [https://webdocs.cs.ualberta.ca/~hayward/papers/
    7 KB (903 words) - 14:07, 28 January 2020
  • Games
    ...s://arxiv.org/abs/1607.08100 arXiv:1607.0810] » [[Monte-Carlo Tree Search|MCTS]]
    68 KB (9,325 words) - 19:50, 4 April 2022
  • Arimaa
    * [[Tomas Kozelek]] ('''2009'''). ''Methods of MCTS and the game Arimaa''. Master's thesis, [http://arimaa.com/arimaa/papers/To * [[Tomáš Jakl]] ('''2011'''). ''Arimaa Challenge – Comparison Study of MCTS versus Alpha-Beta Methods''. B.Sc. thesis, [https://en.wikipedia.org/wiki/C
    10 KB (1,409 words) - 21:01, 6 March 2019
  • Go
    ...chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]] ...//arxiv.org/abs/1409.4297 CoRR abs/1409.4297] » [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
    97 KB (13,316 words) - 20:49, 18 March 2022
  • Hex
    | [[Monte-Carlo Tree Search|MCTS]], [[UCT|RAVE UCT]] | [[Monte-Carlo Tree Search|MCTS]], [[UCT]], Solver
    27 KB (3,617 words) - 16:26, 1 December 2021
  • Othello
    ...rained_models/writeup.pdf pdf] » [[AlphaZero]], [[Monte-Carlo Tree Search|MCTS]], [[Deep Learning]] <ref>[https://github.com/suragnair/alpha-zero-general
    36 KB (5,000 words) - 01:08, 8 December 2020
  • EinStein würfelt nicht!
    ...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
    10 KB (1,482 words) - 11:05, 31 May 2020
  • Chinese Dark Chess
    * [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2014'''). ''Small and Large MCTS Playouts applied to Chinese Dark Chess Stochastic Game''. [[ECAI CGW 2014]]
    7 KB (851 words) - 15:37, 29 June 2020
  • General Game Playing
    ...://arxiv.org/abs/1802.05944 arXiv:1802.05944] » [[Monte-Carlo Tree Search|MCTS]], [[Reinforcement Learning]]
    21 KB (2,723 words) - 12:54, 14 March 2022
  • I-Chen Wu
    ...[[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
    19 KB (2,462 words) - 19:19, 4 April 2022
  • Tristan Cazenave
    : [[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
  • Cameron Browne
    ...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
  • UCT
    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
  • MCαβ
    ...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
  • Bojun Huang
    ...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
  • Richard J. Lorentz
    ...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
  • Ryan Hayward
    ...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
  • Shih-Chieh Huang
    ...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
  • Jakub Pawlewicz
    ...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
  • Aske Plaat
    ...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
  • Jos Vermaseren
    ...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
  • Deep Learning
    ....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
  • Bruno Bouzy
    ...'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
  • AI Factory
    ...). ''[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
  • Raghuram Ramanujan
    ...<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
  • Ashish Sabharwal
    ...<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
  • Bart Selman
    ...<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
  • Ulf Lorenz
    ...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
    ...[[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
  • Wen-Jie Tseng
    ...[[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

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

Retrieved from "https://www.chessprogramming.org/Special:Search"