Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84 exptools; site ihlpg.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!ihlpg!tan
From: tan@ihlpg.UUCP (Bill Tanenbaum)
Newsgroups: net.math,net.puzzle
Subject: Generalized NIM (Mild Spoiler on NIM)
Message-ID: <1242@ihlpg.UUCP>
Date: Fri, 13-Sep-85 14:31:02 EDT
Article-I.D.: ihlpg.1242
Posted: Fri Sep 13 14:31:02 1985
Date-Received: Sat, 14-Sep-85 07:12:38 EDT
References: <280@proper.UUCP> <1130@sphinx.UChicago.UUCP>
Organization: AT&T Bell Laboratories
Lines: 7
Xref: watmath net.math:2254 net.puzzle:1007

The game of NIM nicely generalizes into a game where you may take as
many matches as you want from up to N piles in a single turn.
The solution to generalized NIM is analagous to regular NIM, except the
safe positions are determined by the representations in base N+1,
which of course reduces to binary in regular NIM.
-- 
Bill Tanenbaum - AT&T Bell Labs - Naperville IL  ihnp4!ihlpg!tan