The Alpha-Beta Heuristic
| dc.contributor.author | Edwards, D.J. | en_US |
| dc.contributor.author | Hart, T.P. | en_US |
| dc.date.accessioned | 2004-10-04T14:39:10Z | |
| dc.date.available | 2004-10-04T14:39:10Z | |
| dc.date.issued | 1961-12-01 | en_US |
| dc.identifier.other | AIM-030 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6098 | |
| dc.description.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. | en_US |
| dc.format.extent | 1862386 bytes | |
| dc.format.extent | 1430864 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-030 | en_US |
| dc.title | The Alpha-Beta Heuristic | en_US |
