欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识！
您现在的位置是： 首页  >  数据库

cocos2dx 制作单机麻将(四)

程序员文章站 2024-01-17 15:15:10
...

cocos2dx 制作单机麻将(四) 麻将逻辑5.模拟出牌 [cpp] view plaincopy // //main.cpp //MajiangLogicTest // //CreatedbyTinyUlton14-8-16. //Copyright(c)2014年TinyUlt.Allrightsreserved. // #includeiostream using namespace std; #defineMAX_REPERTORY

cocos2dx 制作单机麻将(四)

麻将逻辑5.模拟出牌

[cpp] view plaincopycocos2dx 制作单机麻将(四)cocos2dx 制作单机麻将(四)

  1. //
  2. // main.cpp
  3. // MajiangLogicTest
  4. //
  5. // Created by TinyUlt on 14-8-16.
  6. // Copyright (c) 2014年 TinyUlt. All rights reserved.
  7. //
  9. #include
  10. using namespace std;
  12. #define MAX_REPERTORY 144
  13. typedef unsigned char BYTE;
  14. typedef unsigned short WORD;
  15. //数组维数
  16. #ifndef CountArray
  17. #define CountArray(Array) (sizeof(Array)/sizeof(Array[0]))
  18. #endif
  19. //逻辑掩码
  21. #define MASK_COLOR 0xF0 //花色掩码
  22. #define MASK_VALUE 0x0F //数值掩码
  23. #define MAX_INDEX 42 //最大索引
  24. #define MAX_COUNT 14 //最大数目
  26. const BYTE m_cbCardDataArray[MAX_REPERTORY]=
  27. {
  28. 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, //万子
  29. 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, //万子
  30. 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, //万子
  31. 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, //万子
  32. 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, //同子
  33. 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, //同子
  34. 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, //同子
  35. 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, //同子
  36. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,0x29, //索子
  37. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,0x29, //索子
  38. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,0x29, //索子
  39. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,0x29, //索子
  41. 0x31,0x32,0x33,0x34, //风牌
  42. 0x31,0x32,0x33,0x34, //风牌
  43. 0x31,0x32,0x33,0x34, //风牌
  44. 0x31,0x32,0x33,0x34, //风牌
  45. 0x41,0x42,0x43, //箭牌
  46. 0x41,0x42,0x43, //箭牌
  47. 0x41,0x42,0x43, //箭牌
  48. 0x41,0x42,0x43, //箭牌
  50. 0x51,0x52,0x53,0x54,0x55,0x56,0x57,0x58, //花牌
  52. };
  53. const char* m_cbCardWordArray[MAX_INDEX]=
  54. {
  55. "一万","二万","三万","四万","五万","六万","七万","八万","九万",
  56. "一筒","二筒","三筒","四筒","五筒","六筒","七筒","八筒","九筒",
  57. "一索","二索","三索","四索","五索","六索","七索","八索","九索",
  58. "东", "南", "西", "北", "中", "发", "白",
  59. "春", "夏", "秋", "冬", "梅", "兰", "竹", "菊"
  60. };
  61. //混乱扑克
  62. static void RandCardData(BYTE cbCardData[],BYTE cbMaxCount)
  63. {
  64. //混乱准备
  65. BYTE cbCardDataTemp[CountArray(m_cbCardDataArray)];//为什么直接用MAX_REPERTORY? 因为这样无耦合
  66. memcpy(cbCardDataTemp,m_cbCardDataArray,sizeof(m_cbCardDataArray));//拷贝一份到临时牌数组中
  68. //混乱扑克(关键的核心打乱代码)
  69. BYTE cbRandCount=0,cbPosition=0;
  70. do
  71. {
  72. cbPosition=rand()%(cbMaxCount-cbRandCount);
  73. cbCardData[cbRandCount++]=cbCardDataTemp[cbPosition];
  74. cbCardDataTemp[cbPosition]=cbCardDataTemp[cbMaxCount-cbRandCount];
  75. } while (cbRandCount
  77. return;
  79. }
  80. //混乱扑克2
  81. void RandAppointCardData(BYTE cbCardData[],BYTE cbMaxCount,BYTE OriginalData[]/*源牌堆数据*/)
  82. {
  83. //混乱扑克
  84. BYTE cbRandCount=0,cbPosition=0;
  85. do
  86. {
  87. cbPosition=rand()%(cbMaxCount-cbRandCount);
  88. cbCardData[cbRandCount++]=OriginalData[cbPosition];
  89. OriginalData[cbPosition]=OriginalData[cbMaxCount-cbRandCount];
  90. } while (cbRandCount
  92. return;
  93. }
  94. //扑克转换(索引->牌值)
  95. BYTE SwitchToCardData(BYTE cbCardIndex)
  96. {
  97. //assert(cbCardIndex
  98. if(cbCardIndexreturn ((cbCardIndex/9)
  99. if(cbCardIndex>=31&&cbCardIndexreturn(((cbCardIndex/7)
  100. if(cbCardIndex>33) return(cbCardIndex+0x2F);
  101. //assert(false);
  102. return 0;
  103. }
  104. //扑克转换(牌型->索引)
  105. BYTE SwitchToCardIndex(BYTE cbCardData)
  106. {
  107. // ASSERT(IsValidCard(cbCardData));
  108. if((cbCardData&MASK_COLOR)
  109. return (((cbCardData&MASK_COLOR)>>4)*9+(cbCardData&MASK_VALUE)-1);
  110. if((cbCardData&MASK_COLOR)==0x40)
  111. return (31+(cbCardData&MASK_VALUE)-1);
  112. if((cbCardData&MASK_COLOR)==0x50)
  113. return (34+(cbCardData&MASK_VALUE)-1);
  114. //ASSERT(false);
  115. return 0;
  116. }
  118. //扑克转换
  119. BYTE SwitchToCardData(BYTE cbCardIndex[MAX_INDEX]/*传入统计所有牌数量的表格*/, BYTE cbCardData[MAX_COUNT]/*传出手牌数据*/)
  120. {
  121. //转换扑克
  122. BYTE cbPosition=0;
  123. for (BYTE i=0;i
  124. {
  125. if (cbCardIndex[i]!=0)
  126. {
  127. for (BYTE j=0;j
  128. {
  129. // ASSERT(cbPosition
  130. cbCardData[cbPosition++]=SwitchToCardData(i);
  131. }
  132. }
  133. }
  135. return cbPosition;//返回手牌数
  136. }
  137. //根据中文牌,得到牌索引
  138. int getIndexByWord(const char* ch)
  139. {
  140. for (int i = 0; i
  141. {
  142. if (!strcmp(ch,m_cbCardWordArray[i]))
  143. {
  144. return i;
  145. }
  146. }
  147. return -1;
  148. }
  149. //删除扑克
  150. bool RemoveCard(BYTE cbCardIndex[MAX_INDEX], BYTE cbRemoveCard)
  151. {
  153. //效验扑克
  154. //ASSERT(IsValidCard(cbRemoveCard));
  155. BYTE cbRemoveIndex=SwitchToCardIndex(cbRemoveCard);
  156. //ASSERT(cbCardIndex[cbRemoveIndex]>0);
  158. //删除扑克
  159. if (cbCardIndex[cbRemoveIndex]>0)
  160. {
  161. cbCardIndex[cbRemoveIndex]--;
  162. return true;
  163. }
  165. //失败效验
  166. // ASSERT(FALSE);
  168. return false;
  169. }
  171. int main(int argc, const char * argv[])
  172. {
  173. // insert code here...
  175. /*第一种混乱发*/
  176. //创建一个空牌堆
  177. BYTE _cardData1[MAX_REPERTORY];
  178. //把在该函数中创建并打乱牌堆,然后把指针传给_cardData;
  179. RandCardData(_cardData1, MAX_REPERTORY);
  180. //输出牌数据
  181. cout"混乱初始牌堆"
  182. for (int i = 0 ; i
  183. {
  184. cout"0x"int(_cardData1[i])" ";
  185. }
  186. cout
  187. cout
  189. /*第二种混乱发*/
  190. //创建一个空牌堆
  191. BYTE _cardData2[MAX_REPERTORY];
  192. //把在该函数中创建并打乱牌堆,然后把指针传给_cardData;
  193. RandAppointCardData(_cardData2, MAX_REPERTORY,_cardData1);
  194. //输出牌数据
  195. cout"混乱指定牌堆"
  196. for (int i = 0 ; i
  197. {
  198. cout"0x"int(_cardData2[i])" ";
  199. }
  200. cout
  201. cout
  203. /*添加手牌*/
  204. //虚拟一副手牌 开始游戏时,每人13张手牌,然后庄家再摸一张牌即14张
  205. //我们使用上面初始化好的牌堆,进行摸牌,假设只有一个玩家
  206. BYTE cbCardIndex[MAX_INDEX];
  207. for (int i = 0; i
  208. {
  209. BYTE _cardValue = _cardData2[i];//得到牌堆中的牌
  210. int _index = SwitchToCardIndex(_cardValue);//得到该牌对应的索引
  211. cbCardIndex[_index]++;//该牌型加一
  212. }
  214. cout"输出所有牌型对应的数量"
  215. for (int i = 0; i
  216. {
  217. cout"(0x"int(SwitchToCardData(i))"):"int)cbCardIndex[i]" ";//输出手牌中所有牌型对应的数量
  218. }
  219. cout
  220. cout
  222. cout"输出手牌数据"
  223. BYTE cbCardData[MAX_COUNT];
  224. int _handsCount = (int)SwitchToCardData(cbCardIndex,cbCardData);
  225. cout"手牌数量为:"
  226. for (int i = 0 ; i
  227. {
  228. cout"(0x"int)cbCardData[i]") ";
  229. }
  231. cout
  232. cout
  234. /*出牌*/
  235. char ch[20];
  236. cout"输入要出的牌(比如 三万): ";
相关标签： cocos2dx 制作 单机 麻将 cocos2dx 制作

上一篇： php的windows版本里有个叫libpq.dll的文件是干什么的？

下一篇： 甲骨文或定MySQL为网络数据库 变有利资产_MySQL

推荐阅读