Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program

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

Thumbnail Image
Download
Name

AIM-047.pdf

Size

3.27 MB

Format

Adobe PDF

Checksum (MD5)

2721cb8c8be62368a640ca4da0f0a5f8

Thumbnail Image
Download
Name

AIM-047.ps

Size

4.15 MB

Format

PostScript

Checksum (MD5)

cf8ff0007d8ca122bb3fde2d8917c9e3

Author(s)
Bloom, Burton H.
Date Issued
February 1, 1963
Series/Report no.
AIM-047
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.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6102
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.