A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program

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

Full metadata record

DC Field	Value	Language
dc.creator	Bloom, Burton H.	-
dc.date	2004-10-04T14:39:27Z	-
dc.date	2004-10-04T14:39:27Z	-
dc.date	1963-02-01	-
dc.date.accessioned	2013-10-09T02:43:00Z	-
dc.date.available	2013-10-09T02:43:00Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-047	-
dc.identifier	http://hdl.handle.net/1721.1/6102	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	The problem of devising a mechanical procedure for playing chess is fundamentally the problem of searching the very large move-tree associated with a chess position. This tree-searching problem is representative of a large class of problems. Consequently, we will first present briefly a general theory of tree-searching problems. This theory will be useful in clarifying the intention of our proposed research.	-
dc.format	4356035 bytes	-
dc.format	3433024 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-047	-
dc.title	A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI