A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program
| dc.contributor.author | Bloom, Burton H. | en_US |
| dc.date.accessioned | 2004-10-04T14:39:27Z | |
| dc.date.available | 2004-10-04T14:39:27Z | |
| dc.date.issued | 1963-02-01 | en_US |
| dc.identifier.other | AIM-047 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6102 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 4356035 bytes | |
| dc.format.extent | 3433024 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-047 | en_US |
| dc.title | A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program | en_US |
