
Fibonacci Nim 1.0 File ID: 85836 


 Fibonacci Nim 1.0 License: Shareware File Size: 10.0 KB Downloads: 51
Submit Rating: 



Fibonacci Nim 1.0 Description 

Description: Description of Game: Objective: Player to play last move wins the Game. A pile of balls(N) is placed between two players (UUU & CPU). Step 1: For the first move, one can remove "p" balls such that N > p >1. Step 2: For the subsequent moves, one can remove "q" balls such that q <= 2p. Note 1: An alternative turn basis is adopted throughout the game. Note 2:Always the user need to make a move to remove balls.
License: Shareware Related: quotqquot, pnote, moves, subsequent, Step, Alternative, basis, 2always, gamenote, adopted, balls, quotpquot, ballsn, gamea, Player, gameobjective, Remove O/S:BSD, Linux, Solaris, Mac OS X File Size: 10.0 KB Downloads: 51


More Similar Code 

This is essentially the fibonacci function from here: http://www.mathworks.com/matlabcentral/fileexchange/5093 I just needed a version which can work on arbitrary arrays.
this is the code that shows how to generate fibonacci numbers fibonacci is a seri that starts with two number 1. then each number is the sum of two previous numbers
Data compression via Fibonacci encoding.
A class Ive had in my snippets for awhile that can generate prime, perfect and fibonacci sequences as well as check whether or not a supplied value is any of them.
A simple object to compute Fibonacci numbers. Object methods return the nth Fibonacci number, return list first n Fibonacci numbers and list from F(k) to F(n) numbers. In a future I hope to add more functions closely related with applications...
This routine shows the surprising behaviour of a random Fibonacci sequence. As reported by Divakar Viswanath  "RANDOM FIBONACCI SEQUENCES AND THE NUMBER 1:13198824..."  in MATHEMATICS OF COMPUTATION, 1999; 69(231): 11311155:
Often I see students asking for help on a tool to compute the Fibonacci numbers. Or, I'll find them asking for help on a Project Euler problem. Or, a student has been assigned the problem of computing the fibonacci numbers using a recursive...
Generators, introduced in Python 2.2, can be used to work with infinite sets. Here is a simple example of a generator that creates the Fibonacci sequence.
For fixed integers a and b with D = a^2 + 4*b positive, the sequence U_n = GeneralizedFibonacci(n,a,b) satisfies the recurrence U_n = a U_{n1} + b U_{n2} with initial conditions U_0 = 0 and U_1 = 1. If a=b=1, this is the Fibonacci sequence.
A platformindependent Javaapplication that calculates really large numbers. Only limited by the power of your computer. Supports mathematical functions like add, sub, mul, div, mod, power, factorial, factorize, fibonacci, binomial coefficient,... 
User Review for Fibonacci Nim 
