Advanced Search
DSpace@MIT

The Alpha-Beta Heuristic

Research and Teaching Output of the MIT Community

The Alpha-Beta Heuristic

Download
Author: Edwards, D.J.; Hart, T.P.
Date Issued: 1961-12-01
Abstract:
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.
URI: http://hdl.handle.net/1721.1/6098
Other Identifiers: AIM-030
Series/Report no.: AIM-030

Show full item metadata

Files in this item

Name Size Format Description
AIM-030.ps 1.776Mb Postscript
AIM-030.pdf 1.364Mb PDF

This item appears in the following Collection(s)

MIT-Mirage