Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-25T04:30:29.917Z Has data issue: false hasContentIssue false
  • English
  • Français

On the distribution of winning moves in random game trees

Published online by Cambridge University Press:  17 April 2009

J. A. Flanigan
J. A. Flanigan
Affiliation:
Department of Mathematics, University of California, Los Angeles, California 90024, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In a natural way, associated with each rooted tree there exists a pair of two-person games, each game possessing the root as initial position. When a rooted tree is selected at random from the set of all rooted trees which possess {1, 2, …, n} as vertex set, the number of winning moves available to the first player to move in each of the associated games is a random variable. For fixed n, we determine the distribution of this random variable. As an immediate consequence, we find the probability that the first player to move has no winning move at all. The “saddlepoint method” is applied to a certain contour integral to obtain the asymptotic distribution of the number of winning moves as n → ∞.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 24 , Issue 2 , October 1981 , pp. 227 - 237
Copyright
Copyright © Australian Mathematical Society 1981

References

[1]Berge, Claude, Graphes et hypergraphes (Monographies universitaires de mathématiques, 37. Dunod, Paris, 1970).Google Scholar
[2]Cayley, [A.], “A theorem on trees”, Quart. J. Pure Appl. Math. 23 (1889), 376–378.Google Scholar
[3]Clarke, L.E., “On Cayley's formula for counting trees”, J. London Math. Soc. 33 (1958), 471–474.Google Scholar
[4]Evgrafov, M.A., Asymptotic estimates and entire functions (translated by Shields, Allen L.. Russian Tracts on Advanced Mathematics and Physics, 4. Gordon and Breach, New York, 1961).Google Scholar
[5] А.И. Марнушевич [Markuševič, A.I.], Теорuя анаnumuческux функuu [Theory of analytic functions] (Gosudarstv. Izdat. Tehn.–Teor. Lit., Moscow, Leningrad, 1950).Google Scholar
[6]Pólya, G., “Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen”, Acta Math. 68 (1937), 145–254.CrossRefGoogle Scholar
[7] В.Н. Сачнов [Sačkov, V.N.], Кaмбuнamopнuе memo∂u ∂ucкреmно [Combinatorial methods in discrete Mathematics] (“Nauka”, Moscow, 1977).Google Scholar