Control strategies for two-player games

  title={Control strategies for two-player games},
  author={Bruce Abramson},
  journal={ACM Comput. Surv.},
  • B. Abramson
  • Published 1 June 1989
  • Economics
  • ACM Comput. Surv.
Computer games have been around for almost as long as computers. Most of these games, however, have been designed in a rather ad hoc manner because many of their basic components have never been adequately defined. In this paper some deficiencies in the standard model of computer games, the minimax model, are pointed out and the issues that a general theory must address are outlined. Most of the discussion is done in the context of control strategies, or sets of criteria for move selection. A… 

Figures from this paper

Heuristic Search in One and Two Player Games

The paper covers some of the dynamic tree splitting methods that have evolved and provides a detailed study of iterative deepening A and its many variants to lead to the development of new theories for dealing with the search of average trees.

AI Wolf Contest - Development of Game AI Using Collective Intelligence -

This study specifies the design of an artificial intelligence (AI) player for a communication game called “Are You a Werewolf?” (AI Wolf) and develops a platform for an AI game competition that uses simplified rules to support the development of AIs that can play Werewolf.

A genetic minimax game-playing strategy

  • T. HongKe-Yuan HuangWen-Yang Lin
  • Computer Science
    1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)
  • 1998
This work proposes a new genetic-algorithm-based approach that can find a good next move by reserving the board evaluation values of new offspring in a partial game-search tree and shows that solution accuracy and search speed are greatly improved by the algorithms.

Adversarial Search and Game Theory

This chapter presents the classes of games as combinatorial and games of chance, then further as zero- sum games and non-zero-sum games, the prisoner’s dilemma, game playing strategies, the games of perfect information, arbitration scheme in games, minimax search in game playing, and analysis of specific games like tic-tac-toe.

Algorithmic approaches for playing and solving Shannon games

An apprenticeship learning approach that takes advantage of this database of Hex games to derive board evaluation functions for strong Hex playing policies is explored and is compared against a temporal difference learning approach and local beam search approach.

A genetic search method for multi-player game playing

  • T. HongKe-Yuan HuangWen-Yang Lin
  • Computer Science
    Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0
  • 2000
A genetic algorithm-based approach that can find good next moves in multi-player games without the requirement for great temporal and spatial expansion is proposed.

Increasing assignment motivation using a game Al tournament

This note describes a rather successful attempt at giving students in a secondary algorithms course a somewhat open assignment that required them to evaluate and use a broad range of programming concepts and ideas.

Expected-Outcome: A General Model of Static Evaluation

  • B. Abramson
  • Economics
    IEEE Trans. Pattern Anal. Mach. Intell.
  • 1990
Overall, the expected-outcome model of two-player games is shown to be precise, accurate, easily estimable, efficiently calculable, and domain-independent.

Chess Pure Strategies are Probably Chaotic

It is shown that chess strategy is equivalent to an autonomous system of differential equations, and conjectured that the system is chaotic, which would explain the forenamed peculiarities and imply that there cannot exist a static evaluator for chess.



A Model of Two-Player Evaluation Functions

It is shown that in large games, estimates of the expected-outcome derived by randomly sampling terminal positions produce reasonable play and the model can be used to automatically learn efficient and effective evaluation functions in a game-independent manner.

The Last Player Theorem

  • D. Nau
  • Computer Science
    Artif. Intell.
  • 1982

Parallel Search of Strongly Ordered Game Trees

Over the past decade major enhancements of the alpha beta algorithm have been developed by people building game-playing programs, and many of these methods will be surveyed and compared here and a brief description of amore, a standard parallel search algorithm for this problem is described.

An Investigation of the Causes of Pathology in Games

  • D. Nau
  • Computer Science
    Artif. Intell.
  • 1982

Experiments With Some Programs That Search Game Trees

The problem of efficiently searching large trees is discussed, and a new method called “dynamic ordering” is described, and the older minimax and Alpha-Beta procedures are described for comparison purposes.

Theory of Games and Economic Behavior.

This is the classic work upon which modern-day game theory is based. What began more than sixty years ago as a modest proposal that a mathematician and an economist write a short paper together

Comparing Minimax and Product in a Variety of Games

Comparisons of the minimax back- up rule and the product back-up rule on a wide variety of games, including P- games, G-games, three-hole kalah, othello, and Ballard's incremental game show the relative performance of minimax and product is related to a parameter called the rate of heuristic flaw (rhf).

Programming a computer for playing chess

This paper is concerned with the problem of constructing a computing routine or “program” for a modern general purpose computer which will enable it to play chess. Although perhaps of no practical

Analysis of the alpha-beta pruning algorithm

An analytical expression for the expected number of bottom positions examined in a game tree using alpha-beta pruning is derived, subject to the assumptions that the branching factor N and the depth D of the tree are arbitrary but fixed, and the bottom positions are a random permutation of (N sub D) unique values.