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. The Alpha-Beta Heuristic

The Alpha-Beta Heuristic

Thumbnail Image
Download
Name

AIM-030.pdf

Size

1.36 MB

Format

Adobe PDF

Checksum (MD5)

fc52a902cd630512b86f2c300048796d

Thumbnail Image
Download
Name

AIM-030.ps

Size

1.78 MB

Format

PostScript

Checksum (MD5)

63127a48117f8356aebe55f75e5b3b05

Author(s)
Edwards, D.J.
•
Hart, T.P.
Date Issued
December 1, 1961
Series/Report no.
AIM-030
Abstract
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.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6098
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.