The Alpha-Beta Heuristic

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6098

Full metadata record

DC Field	Value	Language
dc.creator	Edwards, D.J.	-
dc.creator	Hart, T.P.	-
dc.date	2004-10-04T14:39:10Z	-
dc.date	2004-10-04T14:39:10Z	-
dc.date	1961-12-01	-
dc.date.accessioned	2013-10-09T02:42:58Z	-
dc.date.available	2013-10-09T02:42:58Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-030	-
dc.identifier	http://hdl.handle.net/1721.1/6098	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.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.	-
dc.format	1862386 bytes	-
dc.format	1430864 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-030	-
dc.title	The Alpha-Beta Heuristic	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI