纸牌游戏
纸牌游戏
摘要
纸牌游戏是大家熟知的益智游戏。早期纸牌大部分为数码牌，中国的玩法通常是高点数胜低点数，或以特殊组合牌型取胜，此二原则仍为两大牌戏派别中论计胜负的标准。今天，桥牌已成为高雅的社交与智力活动，反对玩牌的呼声也大为减弱。
本文初始令所有牌的状态 =1 正面向上，执行算法时即以2为基数开始判断，对牌号是 2 的倍数的牌翻牌一次，直到最后一张牌；然后，从第 3 张开始，以 3 为基数，是 3 的倍数的牌翻一 次，直到最后一张牌；再从第4张开始，以 4 为基数，是 4 的倍数的 牌翻一次，直到最后一张牌，接着依次考察判断，将满足 5 的倍数的 牌翻一次，6 的、7 的……直到以 52 为基数进行最后一次的判断，这 样，在经过一系列的翻牌操作后，输出所有正面向上的牌。 存储结点信息采用结点的结构体定义： {int count; int num; int state; card *next; }； 算法设计的主要流程为： 1)建立与 52 张牌分别对应的含 52 个结点的链表； 2)执行翻牌算法之前先输出这 52 张牌； 3)调用翻牌算法按照其中判断规则运行翻牌操作； 4)输出在执行翻牌算法之后的结果，即输出所有最终正面向上的牌；通过两个 for 循环的嵌套， 对牌号是当前基数的倍数的牌进行翻牌操作。
关键字：纸牌游戏；数据结构；翻牌；C 语言
GAME OF PLAYING CARDS
ABSTRACT
Playing cards is a familiar puzzle game. Most early cards for digital brand, Chinese game is usually high number of winning low points, or to win the special combination, this principle is the second of two big play faction on the meter in the outcome of the standard. Today, the bridge has become an elegant social and intellectual activities, play cards against the call has been greatly diminished. This study on the cards after flipping through some rules, face up card number. Initial order all brand of State State=1 positive up, implementation algorithm Shi is to 2 for base began judge, on grade is 2 of multiples of brand double brand once, until last a Zhang brand; then from 4th Zhang began, to 4 for base, is 4 of multiples of brand double once, until last a Zhang brand, then turn investigation judge, will meet 5 of multiples of brand double once, 6 of, and 7 of sth sth Until the base 52 of last judgment, which, after a series of flops when you output all the face up cards. Storage node information node structure definition: typedef struct card{int count;int NUM;int State;card*next;}; Algorithm design of the main processes are: 1) corresponding to the 52 cards each containing 52 knots and the chain of tables; 2) before performing flops algorithm outputs the 52 cards; 3) calls run the flop flop algorithm in accordance with the rules for determ
