Competition against Fallible Opponents.

Abstract

Most previous research on search for game playing has focused on improving search efficiency rather than on better utilizing available information. By developing models based on a notion we call playing strength, we acquire the insight needed to develop strategies which perform better than minimax against both perfect and imperfect opponents. In particular situations, our decision strategies yield improvements comparable to or exceeding those provided by an additional ply of search. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA127487

Entities

People

  • Andrew L. Reibman
  • Bruce W. Ballard

Organizations

  • Duke University

Tags

Communities of Interest

  • Advanced Electronics
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Competition
  • Computer Science
  • Computers
  • Information Science
  • Mathematics
  • Probability
  • Schools
  • Scientific Research
  • Simulations
  • Standards
  • Test And Evaluation
  • Trees (Data Structures)
  • Universities

Readers

  • Game Theory.
  • Instructional Design and Training Evaluation.
  • Reinforced Composite Materials