Difference between revisions of "MCαβ"

From Chessprogramming wiki
Jump to: navigation, search
Line 33: Line 33:
 
* [http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[Leela Chess Zero]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[Leela Chess Zero]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=66414 Alpha-Beta as a rollouts algorithm] by [[Daniel Shawul]], [[CCC]], January 25, 2018 »  [[Alpha-Beta]], [[Monte-Carlo Tree Search]], [[Scorpio]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=66414 Alpha-Beta as a rollouts algorithm] by [[Daniel Shawul]], [[CCC]], January 25, 2018 »  [[Alpha-Beta]], [[Monte-Carlo Tree Search]], [[Scorpio]]
 +
 +
=External Links=
 +
* [[:Category:Larry Coryell|Larry Coryell]] & [[:Category:The Eleventh House|The Eleventh House]] - [https://www.discogs.com/composition/f03f166e-3026-45ed-8b52-fe9999a5cfae-Funky-Waltz Funky Waltz], [https://en.wikipedia.org/wiki/Oslo Oslo] 1975, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 +
: feat. [https://de.wikipedia.org/wiki/Mike_Lawrence Mike Lawrence], [[:Category:Alphonse Mouzon|Alphonse Mouzon]], [[:Category:John Lee|John Lee]], [https://www.discogs.com/artist/138771-Mike-Mandel Mike Mandel]
 +
: {{#evu:https://www.youtube.com/watch?v=_2BfZy6WT3c|alignment=left|valignment=top}}
  
 
=References=  
 
=References=  
Line 38: Line 43:
  
 
'''[[Search|Up one level]]'''
 
'''[[Search|Up one level]]'''
 +
[[Category:Larry Coryell]]
 +
[[Category:John Lee]]
 +
[[Category:Alphonse Mouzon]]
 +
[[Category:The Eleventh House]]

Revision as of 22:15, 13 October 2018

Home * Search * MCαβ

Monte-Carlo Alpha-Beta, (MCαβ)
is a Best-First search algorithm based on Monte-Carlo Tree Search and a shallow alpha-beta depth-first-search. It is used in Lines of Action and in conjunction with UCT (Upper Confidence bounds applied to Trees) also in Chess. It is similar to the the Best-First Minimax-Search proposed by Richard Korf and Max Chickering [1].

Four Phases

MCαβ can be divided into four strategic phases, repeated as long as there is time left:

  1. In the Selection phase the tree is traversed from the root node until it selects a leaf node that is not added to the tree yet
  2. The Expansion strategy adds the leaf node to the tree
  3. The Playout phase performs a shallow alpha-beta search
  4. The Backpropagation strategy propagates the results through the tree

See also

Publications

Forum Posts

External Links

feat. Mike Lawrence, Alphonse Mouzon, John Lee, Mike Mandel

References

Up one level