The Alpha-Beta Heuristic
dc.date.accessioned | 2004-10-04T14:39:10Z | |
dc.date.accessioned | 2018-11-24T10:11:53Z | |
dc.date.available | 2004-10-04T14:39:10Z | |
dc.date.available | 2018-11-24T10:11:53Z | |
dc.date.issued | 1961-12-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/6098 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/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.language.iso | en_US | |
dc.title | The Alpha-Beta Heuristic | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-030.pdf | 1.430Mb | application/pdf | View/ |
AIM-030.ps | 1.862Mb | application/postscript | View/ |