The Alpha-Beta Heuristic

The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the principle variation.

Bibliographic Details
Main Authors: Edwards, D.J., Hart, T.P.
Language:en_US
Published: 2004
Online Access:http://hdl.handle.net/1721.1/6098
_version_ 1826206573798621184
author Edwards, D.J.
Hart, T.P.
author_facet Edwards, D.J.
Hart, T.P.
author_sort Edwards, D.J.
collection MIT
description The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the principle variation.
first_indexed 2024-09-23T13:34:46Z
id mit-1721.1/6098
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T13:34:46Z
publishDate 2004
record_format dspace
spelling mit-1721.1/60982019-04-10T09:57:29Z The Alpha-Beta Heuristic Edwards, D.J. Hart, T.P. The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the principle variation. 2004-10-04T14:39:10Z 2004-10-04T14:39:10Z 1961-12-01 AIM-030 http://hdl.handle.net/1721.1/6098 en_US AIM-030 1862386 bytes 1430864 bytes application/postscript application/pdf application/postscript application/pdf
spellingShingle Edwards, D.J.
Hart, T.P.
The Alpha-Beta Heuristic
title The Alpha-Beta Heuristic
title_full The Alpha-Beta Heuristic
title_fullStr The Alpha-Beta Heuristic
title_full_unstemmed The Alpha-Beta Heuristic
title_short The Alpha-Beta Heuristic
title_sort alpha beta heuristic
url http://hdl.handle.net/1721.1/6098
work_keys_str_mv AT edwardsdj thealphabetaheuristic
AT harttp thealphabetaheuristic
AT edwardsdj alphabetaheuristic
AT harttp alphabetaheuristic