Heuristic Methods

G. M. Adelson-Velsky, V. L. Arlazarov and M. V. Donskoy
Additional contact information
G. M. Adelson-Velsky: Institute for Systems Studies
V. L. Arlazarov: Institute for Systems Studies
M. V. Donskoy: Institute for Systems Studies

Chapter Chapter 2 in Algorithms for Games, 1988, pp 33-76 from Springer

Abstract: Abstract The goal of a game-playing program is to recommend a move in every position presented to it. The recommended move need not be the best, for instance in the sense defined in the preceding chapter, but it should have the highest quality possible, as seen by the professional player, and must be chosen within a preselected time limit. An arbitrary algorithm for choosing a move in the positions of a given game may be looked on as an algorithm for choosing the best move in the base position of the game tree of another game, which we shall call a model game. The tree for the model game is a subtree of the original game tree.

Keywords: Heuristic Method; Base Position; Terminal Position; Game Tree; Good Move (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3796-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461237969

DOI: 10.1007/978-1-4612-3796-9_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().