文件名称:NIMJ
-
所属分类:
- 标签属性:
- 上传时间:2016-10-28
-
文件大小:6.48kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Nim取子游戏是由两个人面对若干堆硬币(或石子)进行的游戏。设有k> 1堆硬币,各堆分别含有N1,N2,……NK枚硬币。游戏的目的就是选择最后剩下的硬币。游戏法则如下:
1.两个游戏人交替进行游戏(游戏人I和游戏人II);
2.当轮到每个游戏人取子时,选择这些堆中的一堆,并从所选的堆中取走至少一枚硬币(游戏人可以取走他所选堆中的全部硬币);
3.当所有的堆都变成空堆时,最后取子的游戏人即为胜者。-Nim game is to take the child by two people face a number of heap of coins (or stones) in a game. With k> 1 stack of coins, each stack containing respectively N1, N2, ...... NK coins. The purpose of the game is to choose the last remaining coins. Rules of the game are as follows: 1. Game two people alternately games (games and people who I II) 2. When it came time to take each game one at midnight, choose a bunch of these heap, and remove at least one coin the selected stack (one can take his game all the selected coin stack) 3. When all have become empty heap heap, the final game to take the child who is the winner.
1.两个游戏人交替进行游戏(游戏人I和游戏人II);
2.当轮到每个游戏人取子时,选择这些堆中的一堆,并从所选的堆中取走至少一枚硬币(游戏人可以取走他所选堆中的全部硬币);
3.当所有的堆都变成空堆时,最后取子的游戏人即为胜者。-Nim game is to take the child by two people face a number of heap of coins (or stones) in a game. With k> 1 stack of coins, each stack containing respectively N1, N2, ...... NK coins. The purpose of the game is to choose the last remaining coins. Rules of the game are as follows: 1. Game two people alternately games (games and people who I II) 2. When it came time to take each game one at midnight, choose a bunch of these heap, and remove at least one coin the selected stack (one can take his game all the selected coin stack) 3. When all have become empty heap heap, the final game to take the child who is the winner.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
NIMJ/NIM.pro
NIMJ/NIM.pro.user
NIMJ/instruction_book.txt
NIMJ/main.cpp
NIMJ/mainwindow.cpp
NIMJ/mainwindow.h
NIMJ/mainwindow.ui
NIMJ/
NIMJ/NIM.pro.user
NIMJ/instruction_book.txt
NIMJ/main.cpp
NIMJ/mainwindow.cpp
NIMJ/mainwindow.h
NIMJ/mainwindow.ui
NIMJ/
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.