Thumbnail
Access Restriction
Open

Author Holshouser, Arthur ♦ Reiter, Harold ♦ Rudzinski, James
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Dynamic One-pile Nim ♦ Combinatorial Game ♦ Successive Move Change ♦ Positive Number ♦ Ordered Pair ♦ One-pile Counter Pickup Game ♦ Maximum Number ♦ Positive Integer
Abstract The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the game. Two players alternate removing a positive number of counters from the pile. An ordered pair (N, x) of positive integers is called a position. The number N represents the size of the
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2003-01-01