Title of article
Winning Strategies and Complexity of Nim-Type Computer Game on Plane
Author/Authors
Boris S. Verkhovsky، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
793
To page
800
Abstract
A Nim-type computer game of strategy on plane is described in this paper. It is demonstrated that winning strategies of this two-person game are determined by a system of equations with two unknown integer sequences. Properties of winning points/states are discussed and an O(loglogn) algorithm for the winning states is provided. Two varieties of the Game are also introduced and their winning strategies are analyzed.
Keywords
Fibonacci numbers , Winning Strategies , Two-person Strategy Game , Nim-type Game , Newton algorithm
Journal title
International Journal of Communications, Network and System Sciences
Serial Year
2010
Journal title
International Journal of Communications, Network and System Sciences
Record number
674265
Link To Document