The Alpha-Beta Heuristic
Citable URI:
http://hdl.handle.net/1721.1/6098
| Title: | The Alpha-Beta Heuristic |
| Author: | Richards, D.J.; Hart, T.P. |
| Issue Date: | 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 |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| AIM-030.pdf | 1.430Mb |
View/ |
||
| AIM-030.ps | 1.862Mb | Postscript |
View/ |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|