This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

minimax_search_with_alpha-beta_pruning [2014/07/08 23:58] will |
minimax_search_with_alpha-beta_pruning [2015/02/02 08:28] (current) |
||
---|---|---|---|

Line 1: | Line 1: | ||

====== Minimax Search with Alpha-Beta Pruning ====== | ====== Minimax Search with Alpha-Beta Pruning ====== | ||

- | Alpha-beta pruning is an optimisation of the minimax algorithm. It limits the search space by culling search paths that cannot contribute to the final result. | + | Alpha-beta pruning is an optimisation of the [[Minimax Search|minimax]] algorithm. It limits the search space by culling search paths that cannot contribute to the final result. |

Alpha represents the maximum score the maximising player is assured of, Beta the minimum score the minimising player is assured of. If beta$\le$alpha, it means a maximising parent node is guaranteed higher score on another branch, or a minimising parent node a lower score on another branch. If this is the case, this branch can be culled and the rest of this node's children can be skipped. | Alpha represents the maximum score the maximising player is assured of, Beta the minimum score the minimising player is assured of. If beta$\le$alpha, it means a maximising parent node is guaranteed higher score on another branch, or a minimising parent node a lower score on another branch. If this is the case, this branch can be culled and the rest of this node's children can be skipped. |

minimax_search_with_alpha-beta_pruning.txt ยท Last modified: 2015/02/02 08:28 (external edit)