SIGN IN
SIGN UP
The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
Full Text:
PDF
Author:
Judea Pearl
Univ. of Califorina, Los Angeles, CA
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 25 Issue 8, Aug 1982
Pages 559-564
ACM
New York, NY
, USA
table of contents
doi>
10.1145/358589.358616
1982 Article
Bibliometrics
· Citation Count: 23
· Downloads (cumulative): 1,290
· Downloads (12 Months): 93
· Downloads (6 Weeks): 9
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
alpha-beta search
average case analysis
branch and bound search
discrete space search
game searching
game tree search
games
graph algorithms
heuristic function construction
interactive proof systems
minimax algorithms
proof complexity
proof theory
search methodologies
sorting and searching
trees
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by