Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Extended Futility Pruning
Home
Publications
Extended Futility Pruning
Extended Futility Pruning
Author:
EH
E.A. Heinz
E.A. Heinz
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 June 1998
journal article
Published by
SAGE Publications
in
ICGA Journal: The Journal of the Computer Games Community
Vol. 21
(2)
,
75-83
DOI:
10.3233/icg-1998-21202
Abstract
This article presents a new selective pruning technique for alpha-beta based game-tree search in computer chess, called extended futility pruning . It builds on ideas of both razoring and normal futility pruning at frontier nodes (depth = 1), and it
Keywords
BUILDS
FUTILITY PRUNING
CALLED EXTENDED
COMPUTER CHESS
FRONTIER NODES
SELECTIVE PRUNING
GAME TREE
ALPHA BETA
Related articles
Cited
Cited by 15 articles
Scroll to top