Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways, Academic Press, London, 1982.
A.S. Fraenkel, The bracket function and complementary sets of integers, Can. J. Math. 21 (1969), 6–27.
A.S. Fraenkel, How to beat your Wythoff games' opponent on three fronts, Amer. Math. Monthly 89 (1982), 353–361.
G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, Oxford University Press, 4-th Edition, 1960.
E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, MD, 1978.
D.E. Knuth, The Art of Computer Programming, Vol. 3; Sorting and Searching, Addison-Wesley, Reading, MA, Second Printing, 1975.
C.D. Olds, Continued Fractions, Random House, New York, 1963.
O. Perron, Die Lehre von den Kettenbrüchen, Band I, Teubner, Stuttgart, 1954.
W. Wythoff, A modification of the game of Nim, Nieuw Arch. Wisk. 7 (1907), 199–202.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraenkel, A.S. (1983). Wythoff games, continued fractions, cedar trees and Fibonacci searches. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036910
Download citation
DOI: https://doi.org/10.1007/BFb0036910
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive