Wythoff games, continued fractions, cedar trees and Fibonacci searches

DOI10.1016/0304-3975(84)90066-5zbMath0557.90107OpenAlexW2026086747MaRDI QIDQ761983

Aviezri S. Fraenkel

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90066-5

zbMATH Keywords

algorithmcedar treecomputation of winning strategiesgeneralized Wythoff gamemisere play

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) 2-person games (91A05) Continued fractions (11A55) Multistage and repeated games (91A20)

Related Items (20)

Computational Hardness of Multidimensional Subtraction Games ⋮ On the misere version of game Euclid and miserable games ⋮ The use and usefulness of numeration systems ⋮ A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory ⋮ The Max-Welter game ⋮ General restriction of \((s,t)\)-Wythoff's game ⋮ Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture ⋮ Further generalizations of the Wythoff game and the minimum excludant ⋮ Combinatorial structure and sumsets associated with Beatty sequences generated by powers of the golden ratio ⋮ Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves ⋮ General restrictions of Wythoff-like games ⋮ Games played by Boole and Galois ⋮ The switch operators and push-the-button games: a sequential compound over rulesets ⋮ On tame, pet, domestic, and miserable impartial games ⋮ Multi-player Wythoff's game and its variants ⋮ Fifty years of Hoare's logic ⋮ Sumsets associated with Wythoff sequences and Fibonacci numbers ⋮ SELF-SIMILARITY OF 𝒫-POSITIONS OF (2n + 1)-DIMENSIONAL WYTHOFF’S GAME ⋮ Sumsets associated with Beatty sequences ⋮ Variants of \((s, t)\)-Wythoff's game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The formal termination problem for programs with finite ALGOL 68-modes
• Sound and complete Hoare-like calculi based on copy rules
• The IO- and OI-hierarchies
• On termination problems for finitely interpreted ALGOL-like programs
• A sound and relatively* complete Hoare-logic for a language with higher type procedures
• Pascal. User manual and report. 2nd ed
• First-order dynamic logic
• On the notion of expressiveness and the rule of adaptation
• On correct procedure parameter transmission in higher programming languages
• Effective Axiomatizations of Hoare Logics
• Ten Years of Hoare's Logic: A Survey—Part I
• Generic commands--a tool for partial correctness formalisms
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• An axiomatic basis for computer programming

This page was built for publication: Wythoff games, continued fractions, cedar trees and Fibonacci searches