Search with Limited Resources.

Abstract

Most game-playing programs make each move after conducting only a partial search of the game tree and applying a static evaluation function at the terminal nodes of that partial search. Given limited resources, what is the optimal partial search to perform? This report presents a model for investigating this question. Results (including the answer to the above question) are obtained for a restricted case of the model. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1983
Accession Number
ADA136122

Entities

People

  • D. C. Mutchler

Organizations

  • Duke University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Artificial Intelligence
  • Classification
  • Computer Programming
  • Computer Science
  • Computers
  • Numbers
  • Probability
  • Probability Distributions
  • Random Variables
  • Security
  • Symmetry
  • Terminals
  • Test And Evaluation
  • Trees (Data Structures)

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Operations Research