Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(84)90066-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026086747 / rank | |||
Normal rank |
Revision as of 01:33, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Wythoff games, continued fractions, cedar trees and Fibonacci searches |
scientific article |
Statements
Wythoff games, continued fractions, cedar trees and Fibonacci searches (English)
0 references
1984
0 references
The generalized Wythoff game may be described as follows: Let A be a positive integer. Given two piles of tokens, two players move alternately. A player may remove any positive number of tokens from a single pile, or he may take from both piles, say k from one and h from the other, provided that \(| k-h| <A\). A normal play means that the player first unable to move is the loser and a misere play means that such a player is the winner. In a previous paper by the author [Am. Math. Mont. 89, 353-361 (1982; Zbl 0504.90087)] it has been shown how the winning strategies may be computed recursively, algebraically and arithmetically in a normal play. In this paper the three analogous strategies are shown and justified for misère play. In addition the concept of ceder tree attached to a Wythoff game is defined and used to compute the winning strategies. The algorithm is stated and its complexity has been computed.
0 references
computation of winning strategies
0 references
misere play
0 references
cedar tree
0 references
generalized Wythoff game
0 references
algorithm
0 references