422
edits
Changes
MCαβ
,no edit summary
'''Monte-Carlo Alpha-Beta''', '''(MCαβ)'''<br/>
is a [[Best-First|Best-First search]] algorithm based on [[Monte-Carlo Tree Search]] and a shallow [[Alpha-Beta|alpha-beta]] [[Depth-First|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|Best-first minimax search]] proposed by [[Richard Korf]] and [[Max Chickering]] <ref>[[Richard Korf]], [[Max Chickering]] ('''1996'''). ''[https://www.microsoft.com/en-us/research/publication/best-first-minimax-search/ Best-First Minimax Search]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], 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 [[evaluation]] function.
<span id="Four Phases"></span>
=Four Phases=
* [[:Category:Larry Coryell|Larry Coryell]] & [[:Category:The Eleventh House|The Eleventh House]], [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=wbpASoseLi4Z9dYOoLqwmE|alignment=left|valignment=top}}
=References=
