Show simple item record

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

dc.date.accessioned2004-10-04T14:39:27Z
dc.date.accessioned2018-11-24T10:11:55Z
dc.date.available2004-10-04T14:39:27Z
dc.date.available2018-11-24T10:11:55Z
dc.date.issued1963-02-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6102
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6102
dc.description.abstractThe 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.en_US
dc.format.extent4356035 bytes
dc.format.extent3433024 bytes
dc.language.isoen_US
dc.titleA Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Programen_US


Files in this item

FilesSizeFormatView
AIM-047.pdf3.433Mbapplication/pdfView/Open
AIM-047.ps4.356Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record