Two-Person Games With Complete Information and the Search of Positions

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 1 in Algorithms for Games, 1988, pp 1-32 from Springer

Abstract: Abstract We recall the recursive definition of a tree. The elements of a tree are nodes and arcs; one of the incident nodes of an arc is called the beginning and the other the end.

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_1

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

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

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 ().