Wythoff games, continued fractions, cedar trees and Fibonacci searches
- 113 Downloads
Recursive, algebraic and arithmetic strategies for winning generalized Wythoff games in misère play are given. The notion of cedar trees, a subset of binary trees, is introduced and used for consolidating these and the normal play strategies. A connection to generalized Fibonacci searches is indicated.
KeywordsNonnegative Integer Continue Fraction Left Shift Algebraic Characterization Left Subtree
Unable to display preview. Download preview PDF.
- 1.E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways, Academic Press, London, 1982.Google Scholar
- 2.A.S. Fraenkel, The bracket function and complementary sets of integers, Can. J. Math. 21 (1969), 6–27.Google Scholar
- 3.A.S. Fraenkel, How to beat your Wythoff games' opponent on three fronts, Amer. Math. Monthly 89 (1982), 353–361.Google Scholar
- 4.G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, Oxford University Press, 4-th Edition, 1960.Google Scholar
- 5.E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, MD, 1978.Google Scholar
- 6.D.E. Knuth, The Art of Computer Programming, Vol. 3; Sorting and Searching, Addison-Wesley, Reading, MA, Second Printing, 1975.Google Scholar
- 7.C.D. Olds, Continued Fractions, Random House, New York, 1963.Google Scholar
- 8.O. Perron, Die Lehre von den Kettenbrüchen, Band I, Teubner, Stuttgart, 1954.Google Scholar
- 9.W. Wythoff, A modification of the game of Nim, Nieuw Arch. Wisk. 7 (1907), 199–202.Google Scholar
- 10.A.M. Yaglom and I.M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, translated by J. McCawley, Jr., revised and edited by B. Gordon, Vol. II, Holden-Day, San Francisco, 1967.Google Scholar