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

源码开发语言/平台
当前位置：首页 > 源码/资料 > 游戏 > 查看源码
destinate.h
资源名称：Visual_C++GameDevelop.rar　[点击查看]
上传用户：sycq158
上传日期：2008-10-22
资源大小：15361k
文件大小：35k
源码类别：

游戏

开发平台：

Visual C++

destinate.h：源码内容
  1. #ifndef DESTINATE_H_
  2. #define DESTINATE_H_
  3. //-----------------//
  4. #include "stdlib.h"
  5. //-----------------//
  6. const int ROW =24;
  7. const int COL =14;
  8. enum VAR;
  9. struct BlockStruct;
  10. class Block;
  11. //----------------//
  12. void GenerateBlock();
  13. bool SetArray(Block & block);
  14. bool ExamArray();
  15. void BreakBlock();
  16. void InitArray();
  17. //----------------//
  18. enum VAR { LL1,LL2,LL3,LL4,
  19. LR5,LR6,LR7,LR8,
  20. C1,C2,C3,C4,
  21. B,
  22. LY1,LY2,
  23. RY1,RY2,
  24. T1,T2
  25. };
  26. //---------------//
  27. struct BlockStruct
  28. {
  29. int red;
  30. int green;
  31. int blue;
  32. bool takeup;
  33. int x;
  34. int y;
  35. };
  36. BlockStruct Array[ROW][COL];
  37. //----------------//
  38. class Block
  39. {
  40. public:
  41. BlockStruct centerpoint;
  42. VAR kind;
  43. public:
  44. Block();
  45. Block(VAR kind,BlockStruct block);
  46. void Generate();
  47. bool LeftOK();
  48. bool RightOK();
  49. bool DownOK();
  50. // bool ShiftOK();
  51. bool Shift();
  52. void Left();
  53. void Right();
  54. void Down();
  55. void ChangeBlock();
  56. void ChangeTrue();
  57. void ChangeFalse();
  58. bool Possiable();
  59. };
  60. //--------------//
  61. void InitArray()
  62. {
  63. int k=0,p=0;
  64. //---------------------//
  65. for(k=0;k<ROW-1;k++)
  66. for(p=1;p<COL-1;p++)
  67. Array[k][p].takeup=false;
  68. //--------------------//
  69. for(k=0;k<ROW;k++)
  70. for(p=0;p<COL;p++)
  71. {
  72. Array[k][p].red=1;
  73. Array[k][p].green=1;
  74. Array[k][p].blue=1;
  75. }
  76. //--------------------//
  77. p=0;
  78. while(p<ROW)
  79. {
  80. Array[p++][0].takeup=true;
  81. }
  82. p=0;
  83. while(p<ROW)
  84. {
  85. Array[p++][COL-1].takeup=true;
  86. }
  87. p=0;
  88. while(p<COL)
  89. {
  90. Array[ROW-1][p++].takeup=true;
  91. }
  93. }
  94. void BreakBlock()
  95. {
  96. int i=1,j=1;
  97. int k,p;
  98. for(j=ROW-2;j>=1;j--)
  99. {
  100. i=1;
  101. while(Array[j][i].takeup)
  102. {
  103. i++;
  104. if(i==COL-2)
  105. {
  106. for(k=j;k>1;k--)
  107. {
  108. p=1;
  109. while(p<COL-1)
  110. {
  111. Array[k][p].takeup=Array[k-1][p].takeup;
  112. p++;
  113. }
  114. }
  115. p=1;
  116. while(p<COL-1)
  117. {
  118. Array[1][p].takeup=false;
  119. p++;
  120. }
  121. break;
  122. }
  123. }
  124. }
  125. }
  127. Block::Block()
  128. {
  129. }
  130. void Block::Generate()
  131. {
  133. int i=rand()%19;
  134. switch(i)
  135. {
  136. case 0: kind=LL1;centerpoint.x=1;break;
  137. case 1: kind=LL2;centerpoint.x=2;break;
  138. case 2: kind=LL3;centerpoint.x=4;break;
  139. case 3: kind=LL4;centerpoint.x=1;break;
  140. case 4: kind=LR5;centerpoint.x=1;break;
  141. case 5: kind=LR6;centerpoint.x=2;break;
  142. case 6: kind=LR7;centerpoint.x=4;break;
  143. case 7: kind=LR8;centerpoint.x=1;break;
  144. case 8: kind=C1; centerpoint.x=1;break;
  145. case 9: kind=C2; centerpoint.x=2;break;
  146. case 10: kind=C3; centerpoint.x=2;break;
  147. case 11: kind=C4; centerpoint.x=2;break;
  148. case 12: kind=B;  centerpoint.x=1;break;
  149. case 13: kind=LY1;centerpoint.x=1;break;
  150. case 14: kind=LY2;centerpoint.x=2;break;
  151. case 15: kind=RY1;centerpoint.x=1;break;
  152. case 16: kind=RY2;centerpoint.x=1;break;
  153. case 17: kind=T1; centerpoint.x=1;break;
  154. case 18: kind=T2; centerpoint.x=1;break;
  155. default:
  156. kind=LL1;
  157. }
  158. centerpoint.y=COL/2;
  159. centerpoint.blue=rand()%255;
  160. centerpoint.green=rand()%255;
  161. centerpoint.red=rand()%255;
  162. }
  163. Block::Block(VAR kind,BlockStruct block)
  164. {
  165. this->kind=kind;
  166. centerpoint=block;
  167. }
  169. /*
  170. bool  Block::LeftOK()
  171. {
  172. switch(this->kind)
  173. {
  174. case LL1:
  175. {
  176.     if(centerpoint.y-1<=0)
  177. return false;
  178. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y-1].takeup&&!Array[centerpoint.x+3][centerpoint.y-1].takeup)
  179. return true;
  180. else
  181. return false;
  182. }
  183. case LL2:
  184. {
  185. if(centerpoint.y-1<=0)
  186. return false;
  187. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x-1][centerpoint.y+2].takeup)
  188. return true;
  189. else
  190. return false;
  192. }
  193. case LL3:
  194. {
  195. if(centerpoint.y-2<=0)
  196. return false;
  197. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x-1][centerpoint.y-1].takeup&&!Array[centerpoint.x-2][centerpoint.y-1].takeup&&!Array[centerpoint.x-3][centerpoint.y-2].takeup)
  198. return true;
  199. else
  200. return false;
  201. }
  202. case LL4:
  203. {
  204. if(centerpoint.y-4<=0)
  205. return false;
  206. if(!Array[centerpoint.x][centerpoint.y-4].takeup&&!Array[centerpoint.x+1][centerpoint.y-4].takeup)
  207. return true;
  208. else
  209. return false;
  210. }
  211. case LR5:
  212. {
  213. if(centerpoint.y-1<=0)
  214. return false;
  215. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y-1].takeup&&!Array[centerpoint.x+3][centerpoint.y-1].takeup)
  216. return true;
  217. else
  218. return false;
  220. }
  221. case LR6:
  222. {
  223. if(centerpoint.y-1<=0)
  224. return false;
  225. if(!Array[centerpoint.x-1][centerpoint.y-1].takeup&&!Array[centerpoint.x][centerpoint.y-1].takeup)
  226. return true;
  227. else
  228. return false;
  230. }
  232. case LR7:
  233. {
  234. if(centerpoint.y-2<=0)
  235. return false;
  236. if(!Array[centerpoint.x][centerpoint.y-2].takeup&&!Array[centerpoint.x-1][centerpoint.y-1].takeup&&!Array[centerpoint.x-2][centerpoint.y-1].takeup&&!Array[centerpoint.x-3][centerpoint.y-1].takeup)
  237. return true;
  238. else
  239. return false;
  240. }
  241. case LR8:
  242. {
  243. if(centerpoint.y-4<=0)
  244. return false;
  245. if(!Array[centerpoint.x][centerpoint.y-4].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup)
  246. return true;
  247. else
  248. return false;
  250. }
  251. case C1 :
  252. {
  253. if(centerpoint.y-2<=0)
  254. return false;
  255. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup)
  256. return true;
  257. else
  258. return false;
  260. }
  261. case C2 :
  262. {
  263. if(centerpoint.y-1<=0)
  264. return false;
  265. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x-1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  266. return true;
  267. else
  268. return false;
  269. }
  270. case C3 :
  271. {
  272. if(centerpoint.y-2<=0)
  273. return false;
  274. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x-1][centerpoint.y-2].takeup)
  275. return true;
  276. else
  277. return false;
  278. }
  279. case C4 :
  280. {
  281. if(centerpoint.y-2<=0)
  282. return false;
  283. if(!Array[centerpoint.x][centerpoint.y-2].takeup&&!Array[centerpoint.x-1][centerpoint.y-2].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup)
  284. return true;
  285. else
  286. return false;
  288. }
  289. case B  :
  290. {
  291. if(centerpoint.y-1<=0)
  292. return false;
  293. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup)
  294. return true;
  295. else
  296. return false;
  297. }
  298. case LY1:
  299. {
  300. if(centerpoint.y-2<=0)
  301. return false;
  302. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup)
  303. return true;
  304. else
  305. return false;
  307. }
  308. case LY2:
  309. {
  310. if(centerpoint.y-1<=0)
  311. return false;
  312. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x-1][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  313. return true;
  314. else
  315. return false;
  317. }
  318. case RY1:
  319. {
  320. if(centerpoint.y-1<=0)
  321. return false;
  322. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  323. return true;
  324. else
  325. return false;
  326. }
  327. case RY2:
  328. {
  329. if(centerpoint.y-2<=0)
  330. return false;
  331. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup&&!Array[centerpoint.x+2][centerpoint.y-2].takeup)
  332. return true;
  333. else
  334. return false;
  336. }
  337. case T1 :
  338. {
  339. if(centerpoint.y-1<=0)
  340. return false;
  341. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y-1].takeup)
  342. return true;
  343. else
  344. return false;
  345. }
  346. case T2 :
  347. {
  348. if(centerpoint.y-1<=0)
  349. return false;
  350. if(!Array[centerpoint.x][centerpoint.y-1].takeup)
  351. return true;
  352. else
  353. return false;
  354. }
  355. default:
  356. {
  357. return false;
  358. }
  360. }
  362. }*/
  363. /*
  364. bool  Block::RightOK()
  365. {
  366. switch(this->kind)
  367. {
  368. case LL1:
  369. {
  370.     if(centerpoint.y+1>=COL-2)
  371. return false;
  372. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup&&!Array[centerpoint.x+3][centerpoint.y+2].takeup)
  373. return true;
  374. else
  375. return false;
  376. }
  377. case LL2:
  378. {
  379.     if(centerpoint.y+3>=COL-2)
  380. return false;
  381. if(!Array[centerpoint.x][centerpoint.y+4].takeup&&!Array[centerpoint.x-1][centerpoint.y+4].takeup)
  382. return true;
  383. else
  384. return false;
  386. }
  387. case LL3:
  388. {
  389.     if(centerpoint.y>=COL-2)
  390. return false;
  391. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x-1][centerpoint.y+1].takeup&&!Array[centerpoint.x-2][centerpoint.y+1].takeup&&!Array[centerpoint.x-3][centerpoint.y+1].takeup)
  392. return true;
  393. else
  394. return false;
  395. }
  396. case LL4:
  397. {
  398.     if(centerpoint.y>=COL-2)
  399. return false;
  400. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup)
  401. return true;
  402. else
  403. return false;
  404. }
  405. case LR5:
  406. {
  407.     if(centerpoint.y+1>=COL-2)
  408. return false;
  409. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup&&!Array[centerpoint.x+3][centerpoint.y+1].takeup)
  410. return true;
  411. else
  412. return false;
  414. }
  415. case LR6:
  416. {
  417.     if(centerpoint.y+3>=COL-2)
  418. return false;
  419. if(!Array[centerpoint.x-1][centerpoint.y+1].takeup&&!Array[centerpoint.x][centerpoint.y+4].takeup)
  420. return true;
  421. else
  422. return false;
  424. }
  426. case LR7:
  427. {
  428.     if(centerpoint.y>=COL-2)
  429. return false;
  430. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x-1][centerpoint.y+1].takeup&&!Array[centerpoint.x-2][centerpoint.y+1].takeup&&!Array[centerpoint.x-3][centerpoint.y+1].takeup)
  431. return true;
  432. else
  433. return false;
  434. }
  435. case LR8:
  436. {
  437.     if(centerpoint.y>=COL-2)
  438. return false;
  439. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup)
  440. return true;
  441. else
  442. return false;
  444. }
  445. case C1 :
  446. {
  447.     if(centerpoint.y+1>=COL-2)
  448. return false;
  449. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup)
  450. return true;
  451. else
  452. return false;
  454. }
  455. case C2 :
  456. {
  457.     if(centerpoint.y+1>=COL-2)
  458. return false;
  459. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x-1][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup)
  460. return true;
  461. else
  462. return false;
  463. }
  464. case C3 :
  465. {
  466.     if(centerpoint.y+1>=COL-2)
  467. return false;
  468. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x-1][centerpoint.y+2].takeup)
  469. return true;
  470. else
  471. return false;
  472. }
  473. case C4 :
  474. {
  475.     if(centerpoint.y>=COL-2)
  476. return false;
  477. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x-1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  478. return true;
  479. else
  480. return false;
  482. }
  483. case B  :
  484. {
  485.     if(centerpoint.y+1>=COL-2)
  486. return false;
  487. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup)
  488. return true;
  489. else
  490. return false;
  491. }
  492. case LY1:
  493. {
  494.     if(centerpoint.y+1>=COL-2)
  495. return false;
  496. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup)
  497. return true;
  498. else
  499. return false;
  501. }
  502. case LY2:
  503. {
  504.     if(centerpoint.y+1>=COL-2)
  505. return false;
  506. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x-1][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup)
  507. return true;
  508. else
  509. return false;
  511. }
  512. case RY1:
  513. {
  514.     if(centerpoint.y+2>=COL-2)
  515. return false;
  516. if(!Array[centerpoint.x][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+3].takeup)
  517. return true;
  518. else
  519. return false;
  520. }
  521. case RY2:
  522. {
  523.     if(centerpoint.y>=COL-2)
  524. return false;
  525. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+2][centerpoint.y].takeup)
  526. return true;
  527. else
  528. return false;
  530. }
  531. case T1 :
  532. {
  533.     if(centerpoint.y>=COL-2)
  534. return false;
  535. if(!Array[centerpoint.x][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup)
  536. return true;
  537. else
  538. return false;
  539. }
  540. case T2 :
  541. {
  542.     if(centerpoint.y+2>=COL-2)
  543. return false;
  544. if(!Array[centerpoint.x][centerpoint.y+3].takeup)
  545. return true;
  546. else
  547. return false;
  548. }
  549. default:
  550. {
  551. return false;
  552. }
  554. }
  556. }
  557. */
  558. // only judge whether it can manipulate  not do action
  559. //只判断不修改centerpoint的值.  
  560. /*
  561. bool Block::DownOK()
  562. {
  563. switch(this->kind)
  564. {
  565. case LL1:
  566. {
  567. if(centerpoint.x+3>=ROW-1)
  568. return false;
  569. if(!Array[centerpoint.x+4][centerpoint.y].takeup&&!Array[centerpoint.x+4][centerpoint.y+1].takeup)
  570. return true;
  571. else
  572. return false;
  573. }
  574. case LL2:
  575. {
  576. if(centerpoint.x>=ROW-1)
  577. return false;
  578. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+3].takeup)
  579. return true;
  580. else
  581. return false;
  583. }
  584. case LL3:
  585. {
  586. if(centerpoint.x>=ROW-1)
  587. return false;
  588. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x-2][centerpoint.y-1].takeup)
  589. return true;
  590. else
  591. return false;
  592. }
  593. case LL4:
  594. {
  595. if(centerpoint.x+1>=ROW-1)
  596. return false;
  597. if(!Array[centerpoint.x+2][centerpoint.y-3].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  598. return true;
  599. else
  600. return false;
  601. }
  602. case LR5:
  603. {
  604. if(centerpoint.x+3>=ROW-1)
  605. return false;
  606. if(!Array[centerpoint.x+4][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup)
  607. return true;
  608. else
  609. return false;
  611. }
  612. case LR6:
  613. {
  614. if(centerpoint.x>=ROW-1)
  615. return false;
  616. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup&&!Array[centerpoint.x+1][centerpoint.y+3].takeup)
  617. return true;
  618. else
  619. return false;
  621. }
  623. case LR7:
  624. {
  625. if(centerpoint.x>=ROW-1)
  626. return false;
  627. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup)
  628. return true;
  629. else
  630. return false;
  631. }
  632. case LR8:
  633. {
  634. if(centerpoint.x+1>=ROW-1)
  635. return false;
  636. if(!Array[centerpoint.x+1][centerpoint.y-3].takeup&&!Array[centerpoint.x+1][centerpoint.y-2].takeup&&!Array[centerpoint.x+1][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y].takeup)
  637. return true;
  638. else
  639. return false;
  641. }
  642. case C1 :
  643. {
  644. if(centerpoint.x+1>=ROW-1)
  645. return false;
  646. if(!Array[centerpoint.x+2][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup)
  647. return true;
  648. else
  649. return false;
  651. }
  652. case C2 :
  653. {
  654. if(centerpoint.x+1>=ROW-1)
  655. return false;
  656. if(!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup)
  657. return true;
  658. else
  659. return false;
  661. }
  662. case C3 :
  663. {
  664. if(centerpoint.x>=ROW-1)
  665. return false;
  666. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x][centerpoint.y-1].takeup&&!Array[centerpoint.x][centerpoint.y+1].takeup)
  667. return true;
  668. else
  669. return false;
  670. }
  671. case C4 :
  672. {
  673. if(centerpoint.x+1>=ROW-1)
  674. return false;
  675. if(!Array[centerpoint.x+2][centerpoint.y-1].takeup&&!Array[centerpoint.x+1][centerpoint.y].takeup)
  676. return true;
  677. else
  678. return false;
  680. }
  681. case B  :
  682. {
  683. if(centerpoint.x+1>=ROW-1)
  684. return false;
  685. if(!Array[centerpoint.x+2][centerpoint.y].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup)
  686. return true;
  687. else
  688. return false;
  689. }
  690. case LY1:
  691. {
  692. if(centerpoint.x+1>=ROW-1)
  693. return false;
  694. if(!Array[centerpoint.x+2][centerpoint.y-1].takeup&&!Array[centerpoint.x+2][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup)
  695. return true;
  696. else
  697. return false;
  699. }
  700. case LY2:
  701. {
  702. if(centerpoint.x+1>=ROW-1)
  703. return false;
  704. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup)
  705. return true;
  706. else
  707. return false;
  709. }
  710. case RY1:
  711. {
  712. if(centerpoint.x+1>=ROW-1)
  713. return false;
  714. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+2][centerpoint.y+1].takeup&&!Array[centerpoint.x+2][centerpoint.y+2].takeup)
  715. return true;
  716. else
  717. return false;
  718. }
  719. case RY2:
  720. {
  721. if(centerpoint.x+2>=ROW-1)
  722. return false;
  723. if(!Array[centerpoint.x+2][centerpoint.y].takeup&&!Array[centerpoint.x+3][centerpoint.y-1].takeup)
  724. return true;
  725. else
  726. return false;
  728. }
  729. case T1 :
  730. {
  731. if(centerpoint.x+2>=ROW-1)
  732. return false;
  733. if(!Array[centerpoint.x+3][centerpoint.y].takeup)
  734. return true;
  735. else
  736. return false;
  737. }
  738. case T2 :
  739. {
  740. if(centerpoint.x>=ROW-1)
  741. return false;
  742. if(!Array[centerpoint.x+1][centerpoint.y].takeup&&!Array[centerpoint.x+1][centerpoint.y+1].takeup&&!Array[centerpoint.x+1][centerpoint.y+2].takeup)
  743. return true;
  744. else
  745. return false;
  746. }
  747. default:
  748. {
  749. return false;
  750. }
  751. }
  753. }*/
  754. bool Block::LeftOK()
  755. {
  756. ChangeFalse();
  757. centerpoint.y-=1;
  758. if(Possiable())
  759. {
  760. centerpoint.y+=1;
  761. return true;
  762. }
  763. else
  764. {
  765. centerpoint.y+=1;
  766. return false;
  767. }
  768. }
  769. bool Block::RightOK()
  770. {
  771. ChangeFalse();
  772. centerpoint.y+=1;
  773. if(Possiable())
  774. {
  775. centerpoint.y-=1;
  776. return true;
  777. }
  778. else
  779. {
  780. centerpoint.y-=1;
  781. return false;
  782. }
  783. }
  784. bool Block::DownOK()
  785. {
  786. ChangeFalse();
  787. centerpoint.x+=1;
  788. if(Possiable())
  789. {
  790. centerpoint.x-=1;
  791. return true;
  792. }
  793. else
  794. {
  795. centerpoint.x-=1;
  796. return false;
  797. }
  798. }
  799. bool Block::Shift()
  800. {
  801. ChangeFalse();
  802. switch(kind)
  803. {
  804. case LL1:
  805. {
  806. centerpoint.x+=2;
  807. centerpoint.y--;
  808. kind=LL2;
  809. if(Possiable())
  810. return true;
  811. else
  812. {
  813. centerpoint.x-=2;
  814. centerpoint.y++;
  815. kind=LL1;
  816. return false;
  817. }
  819. }
  820. case LL2:
  821. {
  822. centerpoint.y+=1;
  823. centerpoint.x+=2;
  824. kind=LL3;
  825. if(Possiable())
  826. return true;
  827. else
  828. {
  829. centerpoint.y-=1;
  830. centerpoint.x-=2;
  831. kind=LL2;
  832. return false;
  833. }
  834. }
  835. case LL3:
  836. {
  837. centerpoint.y+=2;
  838. kind=LL4;
  839. if(Possiable())
  840. return true;
  841. else
  842. {
  843. centerpoint.y-=2;
  844. kind=LL3;
  845. return false;
  846. }
  847. }
  848. case LL4:
  849. {
  850. centerpoint.y-=3;
  851. //centerpoint.x-=2;
  852. kind=LL1;
  853. if(Possiable())
  854. return true;
  855. else
  856. {
  857. centerpoint.y+=3;
  858. // centerpoint.x+=2;
  859. kind=LL4;
  860. return false;
  861. }
  862. }
  863. case LR5:
  864. {
  866. centerpoint.x+=3;
  867. kind=LR6;
  868. if(Possiable())
  869. return true;
  870. else
  871. {
  872. centerpoint.x-=3;
  873. kind=LR5;
  874. return false;
  875. }
  876. }
  877. case LR6:
  878. {
  879. kind=LR7;
  880. centerpoint.x+=1;
  881. if(Possiable())
  882. return true;
  883. else
  884. {
  885. centerpoint.x-=1;
  886. kind=LR6;
  887. return false;
  888. }
  889. }
  891. case LR7:
  892. {
  893. centerpoint.y+=2;
  894. centerpoint.x-=1;
  895. kind=LR8;
  896. if(Possiable())
  897. return true;
  898. else
  899. {
  900. centerpoint.y-=2;
  901. centerpoint.x+=1;
  902. kind=LR7;
  903. return false;
  904. }
  905. }
  906. case LR8:
  907. {
  908. centerpoint.y-=3;
  909. centerpoint.x-=2;
  910. kind=LR5;
  911. if(Possiable())
  912. return true;
  913. else
  914. {
  915. centerpoint.y+=3;
  916. centerpoint.x+=2;
  917. kind=LR8;
  918. return false;
  919. }
  920. }
  921. case C1 :
  922. {
  923. centerpoint.y-=1;
  924. kind=C2;
  925. if(Possiable())
  926. return true;
  927. else
  928. {
  929. centerpoint.y+=1;
  930. kind=C1;
  931. return false;
  932. }
  933. }
  934. case C2 :
  935. {
  936. centerpoint.x+=1;
  937. centerpoint.y+=1;
  938. kind=C3;
  939. if(Possiable())
  940. return true;
  941. else
  942. {
  943. centerpoint.x-=1;
  944. centerpoint.y-=1;
  945. kind=C2;
  946. return false;
  947. }
  948. }
  949. case C3 :
  950. {
  951. centerpoint.x-=1;
  952. kind=C4;
  953. if(Possiable())
  954. return true;
  955. else
  956. {
  957. centerpoint.x+=1;
  958. kind=C3;
  959. return false;
  960. }
  961. }
  962. case C4 :
  963. {
  964. kind=C1;
  965. if(Possiable())
  966. return true;
  967. else
  968. {
  969. kind=C4;
  970. return false;
  971. }
  972. }
  973. case B  :
  974. {
  975. return true;
  976. }
  977. case LY1:
  978. {
  979. centerpoint.y-=1;
  980. kind=LY2;
  981. if(Possiable())
  982. return true;
  983. else
  984. {
  985. centerpoint.y+=1;
  986. kind=LY1;
  987. return false;
  988. }
  989. }
  990. case LY2:
  991. {
  992. centerpoint.y+=1;
  993. kind=LY1;
  994. if(Possiable())
  995. return true;
  996. else
  997. {
  998. centerpoint.y-=1;
  999. kind=LY2;
  1000. return false;
  1001. }
  1002. }
  1003. case RY1:
  1004. {
  1005. centerpoint.y+=1;
  1006. centerpoint.x-=1;
  1007. kind=RY2;
  1008. if(Possiable())
  1009. return true;
  1010. else
  1011. {
  1012. centerpoint.y-=1;
  1013. centerpoint.x+=1;
  1014. kind=RY1;
  1015. return false;
  1016. }
  1017. }
  1018. case RY2:
  1019. {
  1020. centerpoint.x+=1;
  1021. centerpoint.y-=1;
  1022. kind=RY1;
  1023. if(Possiable())
  1024. return true;
  1025. else
  1026. {
  1027. centerpoint.x-=1;
  1028. centerpoint.y+=1;
  1029. kind=RY2;
  1030. return false;
  1031. }
  1032. }
  1033. case T1 :
  1034. {
  1035. centerpoint.x+=1;
  1036. centerpoint.y-=1;
  1037. kind=T2;
  1038. if(Possiable())
  1039. return true;
  1040. else
  1041. {
  1042. centerpoint.x-=1;
  1043. centerpoint.y+=1;
  1044. kind=T1;
  1045. return false;
  1046. }
  1047. }
  1048. case T2 :
  1049. {
  1050. centerpoint.x-=1;
  1051. centerpoint.y+=1;
  1052. kind=T1;
  1053. if(Possiable())
  1054. return true;
  1055. else
  1056. {
  1057. centerpoint.x+=1;
  1058. centerpoint.y-=1;
  1059. kind=T2;
  1060. return false;
  1061. }
  1062. }
  1063. default:
  1064. {
  1065. return false;
  1066. }
  1067. }
  1069. }
  1070. void Block::ChangeBlock()
  1071. {
  1072. switch(kind)
  1073. {
  1074. case LL1:
  1075. {
  1076. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1077. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1078. Array[centerpoint.x+2][centerpoint.y]=centerpoint;
  1079. Array[centerpoint.x+3][centerpoint.y]=centerpoint;
  1080. Array[centerpoint.x+3][centerpoint.y+1]=centerpoint;
  1081. break;
  1083. }
  1084. case LL2:
  1085. {
  1086. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1087. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1088. Array[centerpoint.x][centerpoint.y+2]=centerpoint;
  1089. Array[centerpoint.x][centerpoint.y+3]=centerpoint;
  1090. Array[centerpoint.x-1][centerpoint.y+3]=centerpoint;
  1091. break;
  1092. }
  1093. case LL3:
  1094. {
  1095. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1096. Array[centerpoint.x-1][centerpoint.y]=centerpoint;
  1097. Array[centerpoint.x-2][centerpoint.y]=centerpoint;
  1098. Array[centerpoint.x-3][centerpoint.y]=centerpoint;
  1099. Array[centerpoint.x-3][centerpoint.y-1]=centerpoint;
  1100. break;
  1101. }
  1102. case LL4:
  1103. {
  1104. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1105. Array[centerpoint.x][centerpoint.y-1]=centerpoint;
  1106. Array[centerpoint.x][centerpoint.y-2]=centerpoint;
  1107. Array[centerpoint.x][centerpoint.y-3]=centerpoint;
  1108. Array[centerpoint.x+1][centerpoint.y-3]=centerpoint;
  1109. break;
  1110. }
  1111. case LR5:
  1112. {
  1113. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1114. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1115. Array[centerpoint.x+2][centerpoint.y]=centerpoint;
  1116. Array[centerpoint.x+3][centerpoint.y]=centerpoint;
  1117. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1118. break;
  1119. }
  1120. case LR6:
  1121. {
  1122. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1123. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1124. Array[centerpoint.x][centerpoint.y+2]=centerpoint;
  1125. Array[centerpoint.x][centerpoint.y+3]=centerpoint;
  1126. Array[centerpoint.x-1][centerpoint.y]=centerpoint;
  1127. break;
  1128. }
  1130. case LR7:
  1131. {
  1132. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1133. Array[centerpoint.x-1][centerpoint.y]=centerpoint;
  1134. Array[centerpoint.x-2][centerpoint.y]=centerpoint;
  1135. Array[centerpoint.x-3][centerpoint.y]=centerpoint;
  1136. Array[centerpoint.x][centerpoint.y-1]=centerpoint;
  1137. break;
  1138. }
  1139. case LR8:
  1140. {
  1141. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1142. Array[centerpoint.x][centerpoint.y-1]=centerpoint;
  1143. Array[centerpoint.x][centerpoint.y-2]=centerpoint;
  1144. Array[centerpoint.x][centerpoint.y-3]=centerpoint;
  1145. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1146. break;
  1147. }
  1148. case C1 :
  1149. {
  1150. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1151. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1152. Array[centerpoint.x+1][centerpoint.y-1]=centerpoint;
  1153. Array[centerpoint.x+1][centerpoint.y+1]=centerpoint;
  1154. break;
  1155. }
  1156. case C2 :
  1157. {
  1158. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1159. Array[centerpoint.x-1][centerpoint.y+1]=centerpoint;
  1160. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1161. Array[centerpoint.x+1][centerpoint.y+1]=centerpoint;
  1162. break;
  1163. }
  1164. case C3 :
  1165. {
  1166. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1167. Array[centerpoint.x-1][centerpoint.y-1]=centerpoint;
  1168. Array[centerpoint.x-1][centerpoint.y]=centerpoint;
  1169. Array[centerpoint.x-1][centerpoint.y+1]=centerpoint;
  1170. break;
  1171. }
  1172. case C4 :
  1173. {
  1174. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1175. Array[centerpoint.x-1][centerpoint.y-1]=centerpoint;
  1176. Array[centerpoint.x][centerpoint.y-1]=centerpoint;
  1177. Array[centerpoint.x+1][centerpoint.y-1]=centerpoint;
  1178. break;
  1179. }
  1180. case B  :
  1181. {
  1182. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1183. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1184. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1185. Array[centerpoint.x+1][centerpoint.y+1]=centerpoint;
  1186. break;
  1187. }
  1188. case LY1:
  1189. {
  1190. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1191. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1192. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1193. Array[centerpoint.x+1][centerpoint.y-1]=centerpoint;
  1194. break;
  1195. }
  1196. case LY2:
  1197. {
  1198. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1199. Array[centerpoint.x-1][centerpoint.y]=centerpoint;
  1200. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1201. Array[centerpoint.x+1][centerpoint.y+1]=centerpoint;
  1202. break;
  1203. }
  1204. case RY1:
  1205. {
  1206. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1207. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1208. Array[centerpoint.x+1][centerpoint.y+1]=centerpoint;
  1209. Array[centerpoint.x+1][centerpoint.y+2]=centerpoint;
  1210. break;
  1211. }
  1212. case RY2:
  1213. {
  1214. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1215. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1216. Array[centerpoint.x+1][centerpoint.y-1]=centerpoint;
  1217. Array[centerpoint.x+2][centerpoint.y-1]=centerpoint;
  1218. break;
  1219. }
  1220. case T1 :
  1221. {
  1222. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1223. Array[centerpoint.x+1][centerpoint.y]=centerpoint;
  1224. Array[centerpoint.x+2][centerpoint.y]=centerpoint;
  1225. break;
  1226. }
  1227. case T2 :
  1228. {
  1229. Array[centerpoint.x][centerpoint.y]=centerpoint;
  1230. Array[centerpoint.x][centerpoint.y+1]=centerpoint;
  1231. Array[centerpoint.x][centerpoint.y+2]=centerpoint;
  1232. break;
  1233. }
  1234. default:
  1235. {
  1236. return;
  1237. }
  1238. }
  1240. }
  1241. void Block::Left()
  1242. {
  1243. if(LeftOK())
  1244. centerpoint.y--;
  1245. }
  1246. void Block::Right()
  1247. {
  1248. if(RightOK())
  1249. centerpoint.y++;
  1250. }
  1251. void Block::Down()
  1252. {
  1253. if(DownOK())
  1254. centerpoint.x++;
  1255. }
  1256. void  Block::ChangeTrue()
  1257. {
  1258. centerpoint.takeup=true;
  1259. ChangeBlock();
  1260. }
  1261. void  Block::ChangeFalse()
  1262. {
  1263. centerpoint.takeup=false;
  1264. ChangeBlock();
  1265. }
  1267. bool Block::Possiable()
  1268. {
  1269. switch(kind)
  1270. {
  1271. case LL1:
  1272. {
  1273. if(centerpoint.x+3>=ROW-1||centerpoint.y<=0||centerpoint.y+1>=COL-1)
  1274. return false;
  1275. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+2][centerpoint.y].takeup||Array[centerpoint.x+3][centerpoint.y].takeup||Array[centerpoint.x+3][centerpoint.y+1].takeup)
  1276. return false;
  1277. return true;
  1278. }
  1279. case LL2:
  1280. {
  1281. if(centerpoint.x>=ROW-1||centerpoint.y<=0||centerpoint.y+3>=COL-1)
  1282. return false;
  1283. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x][centerpoint.y+2].takeup||Array[centerpoint.x][centerpoint.y+3].takeup||Array[centerpoint.x-1][centerpoint.y+3].takeup)
  1284. return false;
  1285. return true;
  1286. }
  1287. case LL3:
  1288. {
  1289. if(centerpoint.x>=ROW-1||centerpoint.y-1<=0||centerpoint.y>=COL-1)
  1290. return false;
  1291. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y].takeup||Array[centerpoint.x-2][centerpoint.y].takeup||Array[centerpoint.x-3][centerpoint.y].takeup||Array[centerpoint.x-3][centerpoint.y-1].takeup)
  1292. return false;
  1293. return true;
  1294. }
  1295. case LL4:
  1296. {
  1297. if(centerpoint.x+1>=ROW-1||centerpoint.y-3<=0||centerpoint.y>=COL-1)
  1298. return false;
  1299. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y-1].takeup||Array[centerpoint.x][centerpoint.y-2].takeup||Array[centerpoint.x][centerpoint.y-3].takeup||Array[centerpoint.x+1][centerpoint.y-3].takeup)
  1300. return false;
  1301. return true;
  1302. }
  1303. case LR5:
  1304. {
  1305. if(centerpoint.x+3>=ROW-1||centerpoint.y<=0||centerpoint.y+1>=COL-1)
  1306. return false;
  1307. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+2][centerpoint.y].takeup||Array[centerpoint.x+3][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup)
  1308. return false;
  1309. return true;
  1310. }
  1311. case LR6:
  1312. {
  1313. if(centerpoint.x>=ROW-1||centerpoint.y<=0||centerpoint.y+3>=COL-1)
  1314. return false;
  1315. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x][centerpoint.y+2].takeup||Array[centerpoint.x][centerpoint.y+3].takeup||Array[centerpoint.x-1][centerpoint.y].takeup)
  1316. return false;
  1317. return true;
  1318. }
  1320. case LR7:
  1321. {
  1322. if(centerpoint.x>=ROW-1||centerpoint.y-1<=0||centerpoint.y>=COL-1)
  1323. return false;
  1324. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y].takeup||Array[centerpoint.x-2][centerpoint.y].takeup||Array[centerpoint.x-3][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y-1].takeup)
  1325. return false;
  1326. return true;
  1327. }
  1328. case LR8:
  1329. {
  1330. if(centerpoint.x+1>=ROW-1||centerpoint.y-3<=0||centerpoint.y>=COL-1)
  1331. return false;
  1332. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y-1].takeup||Array[centerpoint.x][centerpoint.y-2].takeup||Array[centerpoint.x][centerpoint.y-3].takeup||Array[centerpoint.x+1][centerpoint.y].takeup)
  1333. return false;
  1334. return true;
  1335. }
  1336. case C1 :
  1337. {
  1338. if(centerpoint.x+1>=ROW-1||centerpoint.y-1<=0||centerpoint.y+1>=COL-1)
  1339. return false;
  1340. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y-1].takeup||Array[centerpoint.x+1][centerpoint.y+1].takeup)
  1341. return false;
  1342. return true;
  1343. }
  1344. case C2 :
  1345. {
  1346. if(centerpoint.x+1>=ROW-1||centerpoint.y<=0||centerpoint.y+1>=COL-1)
  1347. return false;
  1348. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y+1].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y+1].takeup)
  1349. return false;
  1350. return true;
  1351. }
  1352. case C3 :
  1353. {
  1354. if(centerpoint.x>=ROW-1||centerpoint.y-1<=0||centerpoint.y+1>=COL-1)
  1355. return false;
  1356. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y-1].takeup||Array[centerpoint.x-1][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y+1].takeup)
  1357. return false;
  1358. return true;
  1359. }
  1360. case C4 :
  1361. {
  1362. if(centerpoint.x+1>=ROW-1||centerpoint.y-1<=0||centerpoint.y>=COL-1)
  1363. return false;
  1364. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y-1].takeup||Array[centerpoint.x][centerpoint.y-1].takeup||Array[centerpoint.x+1][centerpoint.y-1].takeup)
  1365. return false;
  1366. return true;
  1367. }
  1368. case B  :
  1369. {
  1370. if(centerpoint.x+1>=ROW-1||centerpoint.y<=0||centerpoint.y+1>=COL-1)
  1371. return false;
  1372. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y+1].takeup)
  1373. return false;
  1374. return true;
  1375. }
  1376. case LY1:
  1377. {
  1378. if(centerpoint.x+1>=ROW-1||centerpoint.y-1<=0||centerpoint.y+1>=COL-1)
  1379. return false;
  1380. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y-1].takeup)
  1381. return false;
  1382. return true;
  1383. }
  1384. case LY2:
  1385. {
  1386. if(centerpoint.x+1>=ROW-1||centerpoint.y<=0||centerpoint.y+1>=COL-1)
  1387. return false;
  1388. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x-1][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y+1].takeup)
  1389. return false;
  1390. return true;
  1391. }
  1392. case RY1:
  1393. {
  1394. if(centerpoint.x+1>=ROW-1||centerpoint.y<=0||centerpoint.y+2>=COL-1)
  1395. return false;
  1396. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y+1].takeup||Array[centerpoint.x+1][centerpoint.y+2].takeup)
  1397. return false;
  1398. return true;
  1399. }
  1400. case RY2:
  1401. {
  1402. if(centerpoint.x+2>=ROW-1||centerpoint.y-1<=0||centerpoint.y>=COL-1)
  1403. return false;
  1404. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y-1].takeup||Array[centerpoint.x+2][centerpoint.y-1].takeup)
  1405. return false;
  1406. return true;
  1407. }
  1408. case T1 :
  1409. {
  1410. if(centerpoint.x+2>=ROW-1||centerpoint.y<=0||centerpoint.y>=COL-1)
  1411. return false;
  1412. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x+1][centerpoint.y].takeup||Array[centerpoint.x+2][centerpoint.y].takeup)
  1413. return false;
  1414. return true;
  1415. }
  1416. case T2 :
  1417. {
  1418. if(centerpoint.x>=ROW-1||centerpoint.y<=0||centerpoint.y+2>=COL-1)
  1419. return false;
  1420. if(Array[centerpoint.x][centerpoint.y].takeup||Array[centerpoint.x][centerpoint.y+1].takeup||Array[centerpoint.x][centerpoint.y+2].takeup)
  1421. return false;
  1422. return true;
  1423. }
  1424. default:
  1425. {
  1426. return false;
  1427. }
  1428. }
  1430. }
  1432. bool ExamArray()
  1433. {
  1434. int i=1;
  1435. for(i=1;i<COL-1;i++)
  1436. {
  1437. if(Array[0][i].takeup==true)
  1438. {
  1439. return false;   // dead
  1440. }
  1441. }
  1442. return true;// alive
  1443. }
  1444. bool SetArray(Block & block )
  1445. {
  1446. if(!block.LeftOK()&&!block.RightOK()&&!block.DownOK())
  1447. {
  1448. block.ChangeTrue();
  1449. return false; // the block is nonactive 
  1450. //it should generate new block
  1451. }
  1452. return true; // the block is still active;
  1453. }
  1455. #endif