SIGN IN
SIGN UP
Implementation of a dynamic tree searching algorithm in a chess programme
Full Text:
PDF
Get this Article
Author:
Gerhard Wolf
Published in:
· Proceeding
ACM '73 Proceedings of the ACM annual conference
Pages 206-208
Atlanta, Georgia, USA — August 27 - 29, 1973
ACM
New York, NY
, USA
©1973
table of contents
doi>
10.1145/800192.805704
1973 Article
Bibliometrics
· Citation Count: 0
· Downloads (cumulative): 218
· Downloads (12 Months): 6
· Downloads (6 Weeks): 0
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
algorithmic game theory and mechanism design
algorithms
computer games
discrete space search
game tree search
interactive games
massively multiplayer online games
search methodologies
theory
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