开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 游戏 > 棋牌游戏 > 查看源码
Tzq.cpp
资源名称：tiaoqi.zip　[点击查看]
上传用户：hlqcw8
上传日期：2007-01-08
资源大小：438k
文件大小：21k
源码类别：

棋牌游戏

开发平台：

Visual C++

Tzq.cpp：源码内容
  1. // Tzq.cpp: implementation of the CTzq class.
  2. //
  3. //////////////////////////////////////////////////////////////////////
  5. #include "stdafx.h"
  6. #include "ttq.h"
  7. #include "Tzq.h"
  8. #include "stdio.h"
  9. #ifdef _DEBUG
  10. #undef THIS_FILE
  11. static char THIS_FILE[]=__FILE__;
  12. #define new DEBUG_NEW
  13. #endif
  15. //////////////////////////////////////////////////////////////////////
  16. // Construction/Destruction
  17. //////////////////////////////////////////////////////////////////////
  19. CTzq::CTzq()
  20. {
  21. nPlaySyst=0;
  22. pPlace=NULL;
  23. BeginGame=FALSE;
  24. // memset(aPlace,0,sizeof(aPlace));
  25. for(int i=0;i<6;i++){
  26. for(int j=0;j<10;j++)
  27. {
  28. aPlace[i][j].pTzq=NULL;
  29. aPlace[i][j].nTestUD=0;
  30. }
  31. nPlayType[i]=0;
  32. // nPlayYN[6]=FALSE;
  33. }
  34. memset(aTzqFull,0,sizeof(aTzqFull));
  35. srand( (unsigned)time( NULL ) );
  36. SetTF_nQz(); //初始化aTzqFull数组 nQz;
  37. SetTF_nxy(); //初始化aTzqFull数组 n_x,n_y;
  38. SetTF_pTzq(); //初始化aTzqFull数组 pTzq
  39. SetTF_nPRI(); //初始化aTzqFull数组 nPRI;
  41. SetPlace();             //初始化aPlace数组;
  43. SetTF_nArea(); //初始化aTzqFull数组 nArea;
  46. SetTF_nColor(); //初始化aTzqFull数组 nColor;
  47. for(qzc=0;qzc<6;qzc++)
  48. ChessFull();
  50. }
  52. CTzq::SetTF_nxy()
  53. {
  54. int temp1[18]={1,2,4,7,11,24,36,47,57,66,76,87,99,112,116,119,121,122};
  55. int temp2[18]={0,220,204,188,172,28,44,60,76,92,76,
  56. 60,44,28,172,188,204,220};
  57. int tab,tae=1;
  58. int tyt=30,txt;
  59. // int ttt1;
  60. for(int tj=1;tj<18;tj++){
  61. tab=tae;
  62. tae=temp1[tj];
  63. txt=temp2[tj];
  64. // ttt1=0;
  65. for(int tj1=tab;tj1<tae;tj1++)
  66. {
  67. // ttt1++;
  68. this->aTzqFull[tj1].n_x=txt;
  69. this->aTzqFull[tj1].n_y=tyt;
  70. txt=txt+32;
  71. }
  72. tyt=(int)(tj*27.5)+30;
  73. }
  75. }
  78. CTzq::SetTF_nArea()
  79. {
  81. for(int i=0;i<6;i++)
  82. {
  83. for(int i1=0;i1<10;i1++)
  84. this->aPlace[i][i1].pTzq->nArea=i+1;
  85. }
  87. }
  89. CTzq::SetTF_nColor()
  90. {
  91. for(int i=0;i<6;i++)
  92. {
  93. if(nPlayType[i]!=0)
  94. for(int i1=0;i1<10;i1++)
  95. this->aPlace[i][i1].pTzq->nColor=i+1;
  96. }
  98. }
  100. CTzq::SetTF_nPRI()
  101. {
  103. TzqDate *pTzqDate;
  104. TzqDate *pTzqTemp;
  105. int ntemp[6]={1,11,99,121,111,23};
  106. for(int i=0;i<3;i++){
  107. pTzqDate=&aTzqFull[ntemp[i]];
  108. for(int ni=1;ni<14;ni++)
  109. {
  110. pTzqTemp=pTzqDate;
  111. pTzqTemp->nPRI[i]=ni;
  112. pTzqTemp->nPRI[i+3]=18-ni;
  113. while(pTzqTemp->pTzq[i+2])
  114. {
  115. pTzqTemp=pTzqTemp->pTzq[i+2];
  116. pTzqTemp->nPRI[i]=ni;
  117. pTzqTemp->nPRI[i+3]=18-ni;
  118. }
  119. pTzqTemp=pTzqDate;
  120. pTzqTemp->nPRI[i]=ni;
  121. pTzqTemp->nPRI[i+3]=18-ni;
  122. while(pTzqTemp->pTzq[(i+5)%6])
  123. {
  124. pTzqTemp=pTzqTemp->pTzq[(i+5)%6];
  125. pTzqTemp->nPRI[i]=ni;
  126. pTzqTemp->nPRI[i+3]=18-ni;
  127. }
  128. pTzqDate=pTzqDate->pTzq[i+3];
  129. }
  130. pTzqDate=&aTzqFull[ntemp[i+3]];
  132. for(ni=1;ni<14;ni++)
  133. {
  134. pTzqTemp=pTzqDate;
  135. pTzqTemp->nPRI[i+3]=ni;
  136. pTzqTemp->nPRI[i]=18-ni;
  137. while(pTzqTemp->pTzq[i+2])
  138. {
  139. pTzqTemp=pTzqTemp->pTzq[i+2];
  140. pTzqTemp->nPRI[i+3]=ni;
  141. pTzqTemp->nPRI[i]=18-ni;
  142. }
  143. pTzqTemp=pTzqDate;
  144. pTzqTemp->nPRI[i+3]=ni;
  145. pTzqTemp->nPRI[i]=18-ni;
  146. while(pTzqTemp->pTzq[(i+5)%6])
  147. {
  148. pTzqTemp=pTzqTemp->pTzq[(i+5)%6];
  149. pTzqTemp->nPRI[i+3]=ni;
  150. pTzqTemp->nPRI[i]=18-ni;
  151. }
  152. pTzqDate=pTzqDate->pTzq[i];
  153. }
  154. }
  157. }
  159. CTzq::SetTF_nQz()
  160. {
  161. for(int i=0;i<122;i++)
  162. aTzqFull[i].nQz=i;
  163. }
  165. CTzq::SetTF_pTzq()
  166. {
  167. int temp[6][121]={                      
  168. 0,                     
  169. 1, 0,                   
  170. 2,  3,  0,                  
  171. 4,  5,  6,  0, 
  172. 0,  0,  0,  0,  7,  8,  9, 10,  0,  0,  0,  0,  0,
  173. 12,13,14,15,16,17,18,19,20,21,22,23,
  174. 25,26,27,28,29,30,31,32,33,34,35,
  175. 37,38,39,40,41,42,43,44,45,46,
  176. 48,49,50,51,52,53,54,55,56,
  177. 57,58,59,60,61,62,63,64,65,0,
  178. 66,67,68,69,70,71,72,73,74,75,0,
  179. 76,77,78,79,80,81,82,83,84,85,86,0,
  180. 87,88,89,90,91,92,93,94,95,96,97,98,0,
  181. 104,105,106,107,
  182. 113,114,115,
  183. 117,118,
  184. 120
  186. ,0,
  187. 0,1,
  188. 0,2,3,
  189. 0,4,5,6,
  190. 0,0,0,0,0,7,8,9,10,0,0,0,0,
  191. 11,12,13,14,15,16,17,18,19,20,21,22,
  192. 24,25,26,27,28,29,30,31,32,33,34,
  193. 36,37,38,39,40,41,42,43,44,45,
  194. 47,48,49,50,51,52,53,54,55,
  195. 0,57,58,59,60,61,62,63,64,65,
  196. 0,66,67,68,69,70,71,72,73,74,75,
  197. 0,76,77,78,79,80,81,82,83,84,85,86,
  198. 0,87,88,89,90,91,92,93,94,95,96,97,98,
  199. 103,104,105,106,
  200. 112,113,114,
  201. 116,117,
  202. 119
  204. ,
  205. 0,
  206. 0,2,
  207. 0,4,5,
  208. 0,7,8,9,
  209. 0,11,12,13,14,15,16,17,18,19,20,21,22,
  210. 0,24,25,26,27,28,29,30,31,32,33,34,
  211. 0,36,37,38,39,40,41,42,43,44,45,
  212. 0,47,48,49,50,51,52,53,54,55,
  213. 0,57,58,59,60,61,62,63,64,
  214. 0,66,67,68,69,70,71,72,73,74,
  215. 0,76,77,78,79,80,81,82,83,84,85,
  216. 0,87,88,89,90,91,92,93,94,95,96,97,
  217. 0,99,100,101,102,103,104,105,106,107,108,109,110,
  218. 0,112,113,114,
  219. 0,116,117,
  220. 0,119,
  221. 0
  222. ,
  223. 2,
  224. 4,5,
  225. 7,8,9,
  226. 15,16,17,18,
  227. 0,24,25,26,27,28,29,30,31,32,33,34,35,
  228. 0,36,37,38,39,40,41,42,43,44,45,46,
  229. 0,47,48,49,50,51,52,53,54,55,56,
  230. 0,57,58,59,60,61,62,63,64,65,
  231. 66,67,68,69,70,71,72,73,74,
  232. 76,77,78,79,80,81,82,83,84,85,
  233. 87,88,89,90,91,92,93,94,95,96,97,
  234. 99,100,101,102,103,104,105,106,107,108,109,110,
  235. 0,0,0,0,0,112,113,114,115,0,0,0,0,
  236. 0,116,117,118,
  237. 0,119,120,
  238. 0,121,
  239. 0
  240. ,
  241. 3,
  242. 5,6,
  243. 8,9,10,
  244. 16,17,18,19,
  245. 24,25,26,27,28,29,30,31,32,33,34,35,0,
  246. 36,37,38,39,40,41,42,43,44,45,46,0,
  247. 47,48,49,50,51,52,53,54,55,56,0,
  248. 57,58,59,60,61,62,63,64,65,0,
  249. 67,68,69,70,71,72,73,74,75,
  250. 77,78,79,80,81,82,83,84,85,86,
  251. 88,89,90,91,92,93,94,95,96,97,98,
  252. 100,101,102,103,104,105,106,107,108,109,110,111,
  253. 0,0,0,0,112,113,114,115,0,0,0,0,0,
  254. 116,117,118,0,
  255. 119,120,0,
  256. 121,0,
  257. 0
  258. ,
  259. 0,
  260. 3,0,
  261. 5,6,0,
  262. 8,9,10,0,
  263. 12,13,14,15,16,17,18,19,20,21,22,23,0,
  264. 25,26,27,28,29,30,31,32,33,34,35,0,
  265. 37,38,39,40,41,42,43,44,45,46,0,
  266. 48,49,50,51,52,53,54,55,56,0,
  267. 58,59,60,61,62,63,64,65,0,
  268. 67,68,69,70,71,72,73,74,75,0,
  269. 77,78,79,80,81,82,83,84,85,86,0,
  270. 88,89,90,91,92,93,94,95,96,97,98,0,
  271. 100,101,102,103,104,105,106,107,108,109,110,111,0,
  272. 113,114,115,0,
  273. 117,118,0,
  274. 120,0,
  275. 0};
  280. for(int tttr=1;tttr<122;tttr++){
  282. for(int zz3=0;zz3<6;zz3++)
  283. { if(temp[zz3][tttr-1])
  284. this->aTzqFull[tttr].pTzq[zz3]=&aTzqFull[temp[zz3][tttr-1]];
  286. }
  287. }
  291. }
  293. CTzq::SetPlace()
  294. {
  297. int aset[6][10]={
  298. 1,2,3,4,5,6,7,8,9,10,
  300. 11,12,13,14,24,25,26,36,37,47,
  302. 66,76,77,87,88,89,99,100,101,102,
  304. 112,113,114,115,116,117,118,119,120,121,
  306. 75,85,86,96,97,98,108,109,110,111,
  308. 20,21,22,23,33,34,35,45,46,56
  310. };
  312. for(int aseti=0;aseti<10;aseti++)
  313. {
  314. for(int aseti1=0;aseti1<6;aseti1++)
  315. aPlace[aseti1][aseti].pTzq=&aTzqFull[aset[aseti1][aseti]];
  316. }
  323. }
  326. CTzq::~CTzq()
  327. {
  329. }
  330. HBITMAP hBmp,hbmmp;
  331. HRGN BitmapToRegion (HBITMAP hBmp, COLORREF cTransparentColor = 0, COLORREF cTolerance = 0x101010)
  332. {
  333. HRGN hRgn = NULL;
  335. if (hBmp)
  336. {
  337. // Create a memory DC inside which we will scan the bitmap content
  338. HDC hMemDC = CreateCompatibleDC(NULL);
  339. if (hMemDC)
  340. {
  341. // Get bitmap size
  342. BITMAP bm;
  343. GetObject(hBmp, sizeof(bm), &bm);
  345. // Create a 32 bits depth bitmap and select it into the memory DC 
  346. BITMAPINFOHEADER RGB32BITSBITMAPINFO = {
  347. sizeof(BITMAPINFOHEADER), // biSize 
  348. bm.bmWidth, // biWidth; 
  349. bm.bmHeight, // biHeight; 
  350. 1, // biPlanes; 
  351. 32, // biBitCount 
  352. BI_RGB, // biCompression; 
  353. 0, // biSizeImage; 
  354. 0, // biXPelsPerMeter; 
  355. 0, // biYPelsPerMeter; 
  356. 0, // biClrUsed; 
  357. 0 // biClrImportant; 
  358. };
  359. VOID * pbits32; 
  360. HBITMAP hbm32 = CreateDIBSection(hMemDC, (BITMAPINFO *)&RGB32BITSBITMAPINFO, DIB_RGB_COLORS, &pbits32, NULL, 0);
  361. if (hbm32)
  362. {
  363. HBITMAP holdBmp = (HBITMAP)SelectObject(hMemDC, hbm32);
  365. // Create a DC just to copy the bitmap into the memory DC
  366. HDC hDC = CreateCompatibleDC(hMemDC);
  367. if (hDC)
  368. {
  369. // Get how many bytes per row we have for the bitmap bits (rounded up to 32 bits)
  370. BITMAP bm32;
  371. GetObject(hbm32, sizeof(bm32), &bm32);
  372. while (bm32.bmWidthBytes % 4)
  373. bm32.bmWidthBytes++;
  375. // Copy the bitmap into the memory DC
  376. HBITMAP holdBmp = (HBITMAP)SelectObject(hDC, hBmp);
  377. BitBlt(hMemDC, 0, 0, bm.bmWidth, bm.bmHeight, hDC, 0, 0, SRCCOPY);
  379. // For better performances, we will use the ExtCreateRegion() function to create the
  380. // region. This function take a RGNDATA structure on entry. We will add rectangles by
  381. // amount of ALLOC_UNIT number in this structure.
  382. #define ALLOC_UNIT 100
  383. DWORD maxRects = ALLOC_UNIT;
  384. HANDLE hData = GlobalAlloc(GMEM_MOVEABLE, sizeof(RGNDATAHEADER) + (sizeof(RECT) * maxRects));
  385. RGNDATA *pData = (RGNDATA *)GlobalLock(hData);
  386. pData->rdh.dwSize = sizeof(RGNDATAHEADER);
  387. pData->rdh.iType = RDH_RECTANGLES;
  388. pData->rdh.nCount = pData->rdh.nRgnSize = 0;
  389. SetRect(&pData->rdh.rcBound, MAXLONG, MAXLONG, 0, 0);
  391. // Keep on hand highest and lowest values for the "transparent" pixels
  392. BYTE lr = GetRValue(cTransparentColor);
  393. BYTE lg = GetGValue(cTransparentColor);
  394. BYTE lb = GetBValue(cTransparentColor);
  395. BYTE hr = min(0xff, lr + GetRValue(cTolerance));
  396. BYTE hg = min(0xff, lg + GetGValue(cTolerance));
  397. BYTE hb = min(0xff, lb + GetBValue(cTolerance));
  399. // Scan each bitmap row from bottom to top (the bitmap is inverted vertically)
  400. BYTE *p32 = (BYTE *)bm32.bmBits + (bm32.bmHeight - 1) * bm32.bmWidthBytes;
  401. for (int y = 0; y < bm.bmHeight; y++)
  402. {
  403. // Scan each bitmap pixel from left to right
  404. for (int x = 0; x < bm.bmWidth; x++)
  405. {
  406. // Search for a continuous range of "non transparent pixels"
  407. int x0 = x;
  408. LONG *p = (LONG *)p32 + x;
  409. while (x < bm.bmWidth)
  410. {
  411. BYTE b = GetRValue(*p);
  412. if (b >= lr && b <= hr)
  413. {
  414. b = GetGValue(*p);
  415. if (b >= lg && b <= hg)
  416. {
  417. b = GetBValue(*p);
  418. if (b >= lb && b <= hb)
  419. // This pixel is "transparent"
  420. break;
  421. }
  422. }
  423. p++;
  424. x++;
  425. }
  427. if (x > x0)
  428. {
  429. // Add the pixels (x0, y) to (x, y+1) as a new rectangle in the region
  430. if (pData->rdh.nCount >= maxRects)
  431. {
  432. GlobalUnlock(hData);
  433. maxRects += ALLOC_UNIT;
  434. hData = GlobalReAlloc(hData, sizeof(RGNDATAHEADER) + (sizeof(RECT) * maxRects), GMEM_MOVEABLE);
  435. pData = (RGNDATA *)GlobalLock(hData);
  436. }
  437. RECT *pr = (RECT *)&pData->Buffer;
  438. SetRect(&pr[pData->rdh.nCount], x0, y, x, y+1);
  439. if (x0 < pData->rdh.rcBound.left)
  440. pData->rdh.rcBound.left = x0;
  441. if (y < pData->rdh.rcBound.top)
  442. pData->rdh.rcBound.top = y;
  443. if (x > pData->rdh.rcBound.right)
  444. pData->rdh.rcBound.right = x;
  445. if (y+1 > pData->rdh.rcBound.bottom)
  446. pData->rdh.rcBound.bottom = y+1;
  447. pData->rdh.nCount++;
  449. // On Windows98, ExtCreateRegion() may fail if the number of rectangles is too
  450. // large (ie: > 4000). Therefore, we have to create the region by multiple steps.
  451. if (pData->rdh.nCount == 2000)
  452. {
  453. HRGN h = ExtCreateRegion(NULL, sizeof(RGNDATAHEADER) + (sizeof(RECT) * maxRects), pData);
  454. if (hRgn)
  455. {
  456. CombineRgn(hRgn, hRgn, h, RGN_OR);
  457. DeleteObject(h);
  458. }
  459. else
  460. hRgn = h;
  461. pData->rdh.nCount = 0;
  462. SetRect(&pData->rdh.rcBound, MAXLONG, MAXLONG, 0, 0);
  463. }
  464. }
  465. }
  467. // Go to next row (remember, the bitmap is inverted vertically)
  468. p32 -= bm32.bmWidthBytes;
  469. }
  471. // Create or extend the region with the remaining rectangles
  472. HRGN h = ExtCreateRegion(NULL, sizeof(RGNDATAHEADER) + (sizeof(RECT) * maxRects), pData);
  473. if (hRgn)
  474. {
  475. CombineRgn(hRgn, hRgn, h, RGN_OR);
  476. DeleteObject(h);
  477. }
  478. else
  479. hRgn = h;
  481. // Clean up
  482. SelectObject(hDC, holdBmp);
  483. DeleteDC(hDC);
  484. }
  486. DeleteObject(SelectObject(hMemDC, holdBmp));
  487. }
  489. DeleteDC(hMemDC);
  490. }
  491. }
  493. return hRgn;
  494. }
  495. CTzq::Chess(TzqDate *pTF)
  496. {
  498. for(int i1=0;i1<6;i1++)
  499. ChessOdd(pTF,i1);
  500. }
  503. void CTzq::ChessOdd(TzqDate *pTF, int i1)
  504. {
  505. int it,ht,ii;
  506. TzqDate *pb;
  507. pb=pTF;
  508. ii=0;
  509. it=0;
  510. ht=0;
  511. while(pb->pTzq[i1])
  512. {
  513. pb=pb->pTzq[i1];
  514. if(it==0)
  515. {
  516. if(pb->nColor==0)
  517. ii++;
  518. else 
  519. it=1;
  520. }
  521. else
  522. {
  523. if(ii==0)
  524. {
  525. if(pb->nColor==0)
  526. {
  527. Addpa(pb);
  528. return ;
  530. }
  531. else
  532. return ;
  533. }
  534. else
  535. {
  536. if(pb->nColor==0)
  537. ii--;
  538. else
  539. return ;
  540. }
  541. }
  542. }
  545. }
  547. void CTzq::Addpa(TzqDate *pTF)
  548. {
  550. TzqDate *pb=pTF;
  551. int z=aPlace[qzc][qz].nPlaceArray.GetSize();
  552. for(int i=0;i<z;i++)
  553. {
  554. if(pb->nQz==aPlace[qzc][qz].nPlaceArray[i])
  555. return ;
  556. }
  557. aPlace[qzc][qz].nPlaceArray.Add(pb->nQz);
  558. Chess(pb);
  563. }
  565. CTzq::ChessFull()
  566. {
  567. int j;
  569. for (qz=0;qz<10;qz++)
  570. {
  573. aPlace[qzc][qz].nPlaceArray.RemoveAll();
  576. j=aPlace[qzc][qz].pTzq->nColor;
  577. aPlace[qzc][qz].pTzq->nColor=0;
  579. aPlace[qzc][qz].nPlaceArray.Add(aPlace[qzc][qz].pTzq->nQz);
  580. this->Chess(aPlace[qzc][qz].pTzq);
  581. this->BsetSide(aPlace[qzc][qz].pTzq);
  583. CArray<int,int> yjj;
  584. for(int iz=1;iz<aPlace[qzc][qz].nPlaceArray.GetSize();iz++)
  585. yjj.Add(aPlace[qzc][qz].nPlaceArray[iz]);
  586. aPlace[qzc][qz].nPlaceArray.RemoveAll();
  587. for( iz=0;iz<yjj.GetSize();iz++)
  588. aPlace[qzc][qz].nPlaceArray.Add(yjj[iz]);
  589. aPlace[qzc][qz].pTzq->nColor=j;
  590. }
  593. }
  594. void CTzq::BsetSide(TzqDate *dp)
  595. {
  597. for (int i=0;i<6;i++)
  598. {
  599. if(dp->pTzq[i]!=NULL)
  600. if(dp->pTzq[i]->nColor==0)
  601. aPlace[qzc][qz].nPlaceArray.Add(dp->pTzq[i]->nQz);
  602. }
  603. }
  605. void CTzq::NewGame()
  606. {
  607. pPlace=NULL;
  608. BeginGame=FALSE;
  609. pPlace=NULL;
  610. for(int i=0;i<6;i++){
  611. for(int j=0;j<10;j++)
  612. {
  613. aPlace[i][j].pTzq=NULL;
  614. aPlace[i][j].nTestUD=0;
  615. }
  616. nPlayType[i]=0;
  617. // nPlayYN[6]=FALSE;
  618. }
  619. memset(aTzqFull,0,sizeof(aTzqFull));
  620. srand( (unsigned)time( NULL ) );
  621. SetTF_nQz(); //初始化aTzqFull数组 nQz;
  622. SetTF_nxy(); //初始化aTzqFull数组 n_x,n_y;
  623. SetTF_pTzq(); //初始化aTzqFull数组 pTzq
  624. SetTF_nPRI(); //初始化aTzqFull数组 nPRI;
  626. SetPlace();             //初始化aPlace数组;
  628. SetTF_nArea(); //初始化aTzqFull数组 nArea;
  631. SetTF_nColor(); //初始化aTzqFull数组 nColor;
  632. for(qzc=0;qzc<6;qzc++)
  633. ChessFull();
  635. }
  637. CTzq::GameStep()
  638. {
  640. m_cwnd->InvalidateRect(CRect(375,40,405,70),FALSE);
  641. if(nPlayType[nPlaySyst]!=0)
  642. switch(nPlayType[nPlaySyst])
  643. {
  644. case 1:
  646. break;
  647. case 2:
  648. this->pcstep();
  649. break;
  650. case 3:
  651. this->NetStep();
  652. break;
  653. default:
  654. break;
  655. }
  657. }
  659. CTzq::pcstep()
  660. {
  661. /* int nfff=0;
  662. int ntend,ntt1,ntt2,ntt3,ntt4;
  663. int tempqzz;
  664. ntend=nPlaySyst+3;
  665. if(ntend>5)
  666. ntend=nPlaySyst-3;
  667. for(int nabqq=0;nabqq<10;nabqq++)
  668. {
  669. if(aPlace[nPlaySyst][nabqq].pTzq->nArea==ntend+1)
  670. nfff++;
  671. else
  672. tempqzz=nabqq;
  673. }
  674. if(nfff==9){
  675. CString yj;
  677. yj+="下完!!!";
  678. m_cwnd->MessageBox(yj,"跳子棋");
  680. // if(aPlace[nPlaySyst][tempqzz].pTzq->pTzq[ntend]
  681. ntt1=nPlaySyst+2;
  682. ntt2=nPlaySyst+3;
  683. ntt3=nPlaySyst+4;
  684. ntt4=nPlaySyst+5;
  685. ntt1%=6;
  686. ntt2%=6;
  687. ntt3%=6;
  688. ntt4%=6;
  689. TzqDate * tzqdatetemp=aPlace[nPlaySyst][tempqzz].pTzq;
  690. if(tzqdatetemp->pTzq[ntt2]!=NULL)
  691. {
  692. if((tzqdatetemp->pTzq[ntt2]->nArea==ntend+1)&&
  693. (tzqdatetemp->pTzq[ntt2]->nColor==0))
  694. {
  695. TzqDate *temp;
  696. temp=aPlace[nPlaySyst][tempqzz].pTzq;
  697. aPlace[nPlaySyst][tempqzz].pTzq->nColor=0;
  698. aPlace[nPlaySyst][tempqzz].pTzq=tzqdatetemp->pTzq[ntt2];
  699. aPlace[nPlaySyst][tempqzz].pTzq->nColor=nPlaySyst+1;
  700. this->renovate(temp,aPlace[nPlaySyst][tempqzz].pTzq);
  701. return 0;
  702. }
  703. }
  704. if(tzqdatetemp->pTzq[ntt3]!=NULL)
  705. {
  706. if((tzqdatetemp->pTzq[ntt3]->nArea==ntend+1)&&
  707. (tzqdatetemp->pTzq[ntt3]->nColor==0))
  708. {
  709. TzqDate *temp;
  710. temp=aPlace[nPlaySyst][tempqzz].pTzq;
  711. aPlace[nPlaySyst][tempqzz].pTzq->nColor=0;
  712. aPlace[nPlaySyst][tempqzz].pTzq=tzqdatetemp->pTzq[ntt3];
  713. aPlace[nPlaySyst][tempqzz].pTzq->nColor=nPlaySyst+1;
  714. this->renovate(temp,aPlace[nPlaySyst][tempqzz].pTzq);
  716. return 0;
  717. }
  718. }
  719. while(tzqdatetemp->pTzq[ntt1]!=NULL)
  720. {
  721. tzqdatetemp=tzqdatetemp->pTzq[ntt1];
  722. // if(tzqdatetemp->pTzq[ntt2]
  723. }
  724. tzqdatetemp=aPlace[nPlaySyst][tempqzz].pTzq;
  725. while(tzqdatetemp->pTzq[ntt1]!=NULL)
  726. {
  727. tzqdatetemp=tzqdatetemp->pTzq[ntt1];
  728. // if(tzqdatetemp->pTzq[ntt2]
  729. }
  730. }
  731. */
  732. int zzr,ttt,tt2,tt3;
  733. zzr=-10;
  734. ttt=0;
  735. tt2=0;
  736. tt3=0;
  737. int x,asd1;
  739. int zze;
  740. for(zze=0;zze<10;zze++)
  741. {
  743. for(asd1=0;asd1<aPlace[nPlaySyst][zze].nPlaceArray.GetSize();asd1++)
  744. {
  745. x=aPlace[nPlaySyst][zze].nPlaceArray[asd1];
  746. if(this->aTzqFull[x].nPRI[nPlaySyst]-aPlace[nPlaySyst][zze].pTzq->nPRI[nPlaySyst] >zzr)
  747. {
  748. // if(ab[x].b[0]-abz[1][zze].a->b[0]==zzr
  749. // &&ab[x].a
  750. if((aTzqFull[x].nArea==nPlaySyst+1)
  751. ||(aTzqFull[x].nArea==0)
  752. ||(aTzqFull[x].nArea==((nPlaySyst+3>=6)?(nPlaySyst-3):(nPlaySyst+3))+1))
  754. {
  755. ttt=zze;
  756. tt3=asd1;
  757. tt2=aPlace[nPlaySyst][zze].nPlaceArray[asd1];
  758. zzr=aTzqFull[aPlace[nPlaySyst][zze].nPlaceArray[asd1]].nPRI[nPlaySyst]-aPlace[nPlaySyst][zze].pTzq->nPRI[nPlaySyst];
  759. }
  760. }
  761. else
  762. if(aTzqFull[x].nPRI[nPlaySyst]-aPlace[nPlaySyst][zze].pTzq->nPRI[nPlaySyst]==zzr)
  763. {
  765. char crand=(char)rand();
  766. // if(crand<0)
  767. // MessageBox("fdslafk");
  768. if(crand>0)
  769. {
  770. // if(abz[1][zze].a->a!=1)
  771. {
  773. if((aTzqFull[x].nArea==nPlaySyst+1)
  774. ||(aTzqFull[x].nArea==0)
  775. ||(aTzqFull[x].nArea==(((nPlaySyst+3>=6)?(nPlaySyst-3):(nPlaySyst+3))+1)))
  776. {
  777. ttt=zze;
  778. tt3=asd1;
  779. tt2=aPlace[nPlaySyst][zze].nPlaceArray[asd1];
  780. zzr=aTzqFull[aPlace[nPlaySyst][zze].nPlaceArray[asd1]].nPRI[nPlaySyst]-aPlace[nPlaySyst][zze].pTzq->nPRI[nPlaySyst];
  782. }
  783. }
  784. }
  786. }
  787. }
  788. }
  791. this->aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]].nColor=aPlace[nPlaySyst][ttt].pTzq->nColor;
  792. aPlace[nPlaySyst][ttt].pTzq->nColor=0;
  793. m_cwnd->InvalidateRect(
  794. CRect(
  795. aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]].n_x-15,
  796. aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]].n_y-15,
  797. aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]].n_x+17,
  798. aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]].n_y+17),0);
  799. m_cwnd->InvalidateRect(
  800. CRect(
  801. aPlace[nPlaySyst][ttt].pTzq->n_x-15,
  802. aPlace[nPlaySyst][ttt].pTzq->n_y-15,
  803. aPlace[nPlaySyst][ttt].pTzq->n_x+17,
  804. aPlace[nPlaySyst][ttt].pTzq->n_y+17),0);
  805. aPlace[nPlaySyst][ttt].pTzq=&aTzqFull[this->aPlace[nPlaySyst][ttt].nPlaceArray[tt3]];
  809. int ffff=1,fff1=1;
  810. int tend;
  811. tend=nPlaySyst+3;
  812. if(tend>5)
  813. tend=nPlaySyst-3;
  814. for(int abqq=0;abqq<10;abqq++)
  815. {
  816. if(aPlace[nPlaySyst][abqq].pTzq->nArea!=tend+1)
  817. ffff=0;
  818. }
  819. if(ffff==1){
  820. CString yj;
  821. yj.Format("!!!玩家%d",this->nPlaySyst+1);
  822. yj+="下完!!!";
  823. m_cwnd->MessageBox(yj,"跳子棋");
  824. // newgame();
  825. // this->Invalidate(0);
  826. this->nPlayType[nPlaySyst]=0;
  827. }
  828. int nti=0;
  829. for(int t=0;t<6;t++)
  830. {
  831. nti+=nPlayType[t];
  832. }
  833. if(nti==0)
  834. return 0;
  835. for(qzc=0;qzc<6;qzc++)
  836. this->ChessFull();
  837. nPlaySyst++;
  838. nPlaySyst%=6;
  839. while(nPlayType[nPlaySyst]==0)
  840. {
  841. nPlaySyst++;
  843. nPlaySyst%=6;
  844. }
  847. GameStep();
  851. return 0;
  852. }
  854. CTzq::NetStep()
  855. {
  857. }
  859. int CTzq::qzsetel(CPoint point)
  860. {
  861. CRect rgn;
  862. for(int i=0;i<122;i++)
  863. {
  864. rgn=CRect(
  865. aTzqFull[i].n_x-9,
  866. aTzqFull[i].n_y-9,
  867. aTzqFull[i].n_x+9,
  868. aTzqFull[i].n_y+9);
  870. if(rgn.PtInRect(point))
  871. { 
  872. return i;
  873. }
  874. }
  876. return 0;
  877. }
  879. BOOL CTzq::StepPath(CPlace *pplace, TzqDate *ptzq,int i1)
  880. {
  881. int it,ht,ii;
  882. TzqDate *pb;
  883. pb=pplace->pTzq;
  884. ii=0;
  885. it=0;
  886. ht=0;
  887. while(pb->pTzq[i1])
  888. {
  889. pb=pb->pTzq[i1];
  890. if(it==0)
  891. {
  892. if(pb->nColor==0)
  893. ii++;
  894. else 
  895. it=1;
  896. }
  897. else
  898. {
  899. if(ii==0)
  900. {
  901. if(pb->nColor==0)
  902. {
  903. // Addpa(pb);
  904. if(pb->nQz==ptzq->nQz)
  905. return TRUE;
  906. else 
  907. return FALSE;
  909. }
  910. else
  911. return FALSE;
  912. }
  913. else
  914. {
  915. if(pb->nColor==0)
  916. ii--;
  917. else
  918. return FALSE;
  919. }
  920. }
  921. }
  922. return FALSE;
  925. }
  927. CTzq::renovate(TzqDate * t1, TzqDate * t2)
  928. {
  930. m_cwnd->InvalidateRect(
  931. CRect(
  932. t1->n_x-15,
  933. t1->n_y-15,
  934. t1->n_x+17,
  935. t1->n_y+17),0);
  936. m_cwnd->InvalidateRect(
  937. CRect(
  938. t2->n_x-15,
  939. t2->n_y-15,
  940. t2->n_x+17,
  941. t2->n_y+17),0);
  946. int ffff=1,fff1=1;
  947. int tend;
  948. tend=nPlaySyst+3;
  949. if(tend>5)
  950. tend=nPlaySyst-3;
  951. for(int abqq=0;abqq<10;abqq++)
  952. {
  953. if(aPlace[nPlaySyst][abqq].pTzq->nArea!=tend+1)
  954. ffff=0;
  955. }
  956. if(ffff==1){
  957. CString yj;
  958. yj.Format("!!!玩家%d",this->nPlaySyst+1);
  959. yj+="下完!!!";
  960. m_cwnd->MessageBox(yj,"跳子棋");
  961. // newgame();
  962. // this->Invalidate(0);
  963. this->nPlayType[nPlaySyst]=0;
  964. }
  966. for(qzc=0;qzc<6;qzc++)
  967. this->ChessFull();
  968. nPlaySyst++;
  969. nPlaySyst%=6;
  970. while(nPlayType[nPlaySyst]==0)
  971. {
  972. nPlaySyst++;
  974. nPlaySyst%=6;
  975. }
  978. GameStep();
  979. }