Wythoff games, continued fractions, cedar trees and Fibonacci searches

DOI10.1016/0304-3975(84)90066-5zbMATH Open0557.90107OpenAlexW2026086747MaRDI QIDQ761983FDOQ761983

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

Recommendations

• Euclid and Wythoff games
• Cold positions of the restricted Wythoff's game
• A new heap game
• General restriction of \((s,t)\)-Wythoff's game
• Around Wythoff's game

zbMATH Keywords

algorithmcedar treecomputation of winning strategiesgeneralized Wythoff gamemisere play

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (24)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761983)