enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Fibonacci nim - Wikipedia

    en.wikipedia.org/wiki/Fibonacci_nim

    Visual representation of the Zeckendorf representations of each number (a row of the image) as a sum of Fibonacci numbers (the widths of rectangles intersecting that row). An optimal strategy in Fibonacci nim removes the smallest rectangle in the row for the current pile of coins, leaving a pile described by the remaining rectangles from that row.

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing of irregular objects is a problem not lending itself well to closed form solutions; however, the applicability to practical environmental science is quite important. For example, irregularly shaped soil particles pack differently as the sizes and shapes vary, leading to important outcomes for plant species to adapt root formations and ...

  4. Mia's Science Adventure: Romaine's New Hat - Wikipedia

    en.wikipedia.org/wiki/Mia's_Science_Adventure...

    Mia's Science Adventure: Romaine's New Hat is the second title of the Mia's Big Adventure Collection software series created by Kutoka Interactive. Released in 2000 in Canada and the United States , the game teaches sciences to children between 6 and 10 years old.

  5. Impartial game - Wikipedia

    en.wikipedia.org/wiki/Impartial_game

    As there is a finite number of coins in any stack, a player may only remove a finite number of coins. All operations must be able to be done by both sides. In all Impartial games, the players are making actions to some game board whether in the form of stacks for Nim or rows and columns Cram.

  6. Coin problem - Wikipedia

    en.wikipedia.org/wiki/Coin_problem

    Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs: Sloping lines denote graphs of 2x+5y=n where n is the total in pence, and x and y are the non-negative number of 2p and 5p coins, respectively. A point on a line gives a combination of 2p and 5p for its given total (green).

  7. Balance puzzle - Wikipedia

    en.wikipedia.org/wiki/Balance_puzzle

    For example, in detecting a dissimilar coin in three weighings (⁠ = ⁠), the maximum number of coins that can be analyzed is ⁠ = ⁠.Note that with ⁠ ⁠ weighings and ⁠ ⁠ coins, it is not always possible to determine the nature of the last coin (whether it is heavier or lighter than the rest), but only that the other coins are all the same, implying that the last coin is the ...

  8. Coins in a fountain - Wikipedia

    en.wikipedia.org/wiki/Coins_in_a_fountain

    Coins in a fountain is a problem in combinatorial mathematics that involves a generating function.In this problem, a fountain is an arrangement of non-overlapping unit circles into horizontal rows in the plane so that consecutive circles in the bottom row are tangent to each other, and such that each circle in a higher row is tangent to two coins from the next row below it.

  9. Play money - Wikipedia

    en.wikipedia.org/wiki/Play_money

    At its most basic level, play money refers to faux paper money, but some games can include coins, or more abstract tokens representing more generic resources (such as energy). [ 2 ] : 25-26 Play money also encompasses virtual currencies in the complex in-game economies of MMORPGs , but again unlike older physical play money, in-game virtual ...