Best node search: Difference between revisions
Content deleted Content added
I am not accustomed to wikipedia, so i used mtd-f document. sorry for my bad english. |
changed reference to external links |
||
| Line 1: | Line 1: | ||
'''Best Node Search''', is a [[minimax]] search algorithm, developed in 2011. Experiments with random trees show it to be the moste efficient minimax algorithm. This algorithm does tell which move leads to minmax, but does not tell the evaluation of minimax. |
'''Best Node Search''', is a [[minimax]] search algorithm, developed in 2011. Experiments with random trees show it to be the moste efficient minimax algorithm. This algorithm does tell which move leads to minmax, but does not tell the evaluation of minimax. |
||
== |
==Performance== |
||
[[MTD-f]] guesses the minimax by calling zero-window alpha-beta prunings. BNS calls search that tells whether the minmax in the subtree is smaller or bigger than the guess. it changes the guessed value until alpha and beta is close enough or only one subtree allows minimax value bigger than guessed value. |
[[MTD-f]] guesses the minimax by calling zero-window alpha-beta prunings. BNS calls search that tells whether the minmax in the subtree is smaller or bigger than the guess. it changes the guessed value until alpha and beta is close enough or only one subtree allows minimax value bigger than guessed value. |
||
== |
==External Links== |
||
http://www.bjmc.lu.lv/fileadmin/user_upload/lu_portal/projekti/bjmc/Contents/770_7.pdf |
[[http://www.bjmc.lu.lv/fileadmin/user_upload/lu_portal/projekti/bjmc/Contents/770_7.pdf]] |
||
https://dspace.lu.lv/dspace/bitstream/handle/7/4903/38550-Dmitrijs_Rutko_2013.pdf |
[[https://dspace.lu.lv/dspace/bitstream/handle/7/4903/38550-Dmitrijs_Rutko_2013.pdf]] |
||
<references /> |
<references /> |
||
Revision as of 11:24, 11 October 2016
Best Node Search, is a minimax search algorithm, developed in 2011. Experiments with random trees show it to be the moste efficient minimax algorithm. This algorithm does tell which move leads to minmax, but does not tell the evaluation of minimax.
Performance
MTD-f guesses the minimax by calling zero-window alpha-beta prunings. BNS calls search that tells whether the minmax in the subtree is smaller or bigger than the guess. it changes the guessed value until alpha and beta is close enough or only one subtree allows minimax value bigger than guessed value.