Moving into the Desert with Fibonacci (Q4359119)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1071803
Language Label Description Also known as
default for all languages
No label defined
    English
    Moving into the Desert with Fibonacci
    scientific article; zbMATH DE number 1071803

      Statements

      0 references
      7 September 1998
      0 references
      combinatorial movement
      0 references
      jumping pegs
      0 references
      unbounded chess board
      0 references
      Fibonacci numbers
      0 references
      Moving into the Desert with Fibonacci (English)
      0 references
      E. Berlekamp, J. Conway and R. Guy considered in their well-known book `Winning ways for your mathematical plays'' the following game on an unbounded chess board, devided by a straight line into land and desert: pegs placed on the board can move by jumping over a neighboring peg onto a free place in horizontal or vertical direction, removing the peg that has been jumped over. Clearly, two pegs on the land side suffice to jump with one peg one step into the desert. To place a peg two steps into the desert, we need 4 pegs on the land side and three jumps. Inductive combinatorial reasoning leads to the results that 8 pegs on the land side are needed for 3 steps into the desert, 16 pegs are needed for 4 steps, but that it is impossible to move a peg 5 or more steps into the desert. The original proof is modified by the author using Fibonacci numbers and generalized to three- and finite-dimensional chess boards. Pleasant reading.
      0 references

      Identifiers