John Isbell's Game of Beanstalk and John Conway's Game of Beans-Don't-Talk

DOI10.2307/2689400zbMATH Open0618.90101OpenAlexW4231978339MaRDI QIDQ3755260FDOQ3755260

Authors: Richard K. Guy 

Publication date: 1986

Full work available at URL: https://doi.org/10.2307/2689400

Recommendations

• Take-away games on Beatty's theorem and the notion of \(k\)-invariance
• The game of 3-Euclid
• A morphic approach to combinatorial games: the Tribonacci case
• Variations of the game 3-Euclid
• Rulesets for Beatty games

zbMATH Keywords

remoteness\(3x+1\) problemcompletely determined games\({\mathcal N}\)-position\({\mathcal O}\)-position\({\mathcal P}\)-positionBeanstalk

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) 2-person games (91A05)

Cited In (1)

• Preface

This page was built for publication: John Isbell's Game of Beanstalk and John Conway's Game of Beans-Don't-Talk

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