Counting the number of winning binary strings in the 1-dimensional same game

MaRDI QIDQ3601217zbMATH OpenFDO

Authors Chris Burns, Benjamin Purcell

Publication date 10 February 2009

Full work available at URL http://www.fq.math.ca/45-3.html

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 1472198
• Restricted binary strings and generalized Fibonacci numbers
• Fibonacci Nim and a full characterization of winning moves
• Winning Nim with Beatty and Fibonacci
• Collapse: A Fibonacci and Sturmian Game

Cited in

(1)

• scientific article; zbMATH DE number 3927976 (Why is no real title available?)

This page was built for publication: Counting the number of winning binary strings in the 1-dimensional same game

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