Assignment 1
Context
The game of Nim is a simple game played between two (2) players. Twenty one
(21) matches are arranged into positions on a triangular grid of locations. Each
player takes turns removing either one (1), two (2), or three (3) matches from a
location on the grid. The player that removes the last match loses.
An example implementation of the Nim game is the following:
The application of this game to computing is the design of a program that
allows a human to play against the computer.
以上的是要求 ，请高手帮帮忙 急需 先在这里谢谢了

思路：每次留给对方的火柴数为1，5，9，13，17，21，则对方一定输。
证明：“1”显然成立；
“5”不管对方去多少，我都可以留“1”根火柴给对方，
“9”不管对方去多少，我都可以留“5”根火柴给对方，
。。。。。。。。

递归
.............

楼主的要求不是去实现算法，而是去实现玩家和电脑对战的过程
不过算法也重要

谁能帮我编下代码 感激不尽啊
要求不一定与电脑
可以两个人玩 不过这些都没有关系
本来还用到ADT做图象的 这个先不管 了
先谢过了