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

源码开发语言/平台
当前位置：首页 > 源码/资料 > Java编程 > 查看源码
Six.java~1~
资源名称：Java.rar　[点击查看]
上传用户：liming9091
上传日期：2014-10-27
资源大小：3376k
文件大小：10k
源码类别：

Java编程

开发平台：

Java

Six.java~1~：源码内容
  1. public class Six extends Root
  2. {
  3. private GameTable gTable;
  4. private int x,y;
  5. private int direct=1;
  6. private int[] store;
  11. public Six()
  12. {
  13. store=new int[15];
  14. }
  16. public boolean begin()
  17. {
  18. if((gTable.myTable[(gTable.x-1)/2][0]==0)&&(gTable.myTable[(gTable.x-1)/2+1][0]==0)&&
  19. (gTable.myTable[(gTable.x-1)/2+1][1]==0)&&(gTable.myTable[(gTable.x-1)/2+1][2]==0))
  20. {
  21. x=(gTable.x-1)/2;
  22. y=0;
  23. gTable.myTable[x][y]=1;
  24. gTable.myTable[x+1][y]=1;
  25. gTable.myTable[x+1][y+1]=1;
  26. gTable.myTable[x+1][y+2]=1;
  27. return true;
  28. }
  29. else
  30. {
  31. return false;
  32. }
  33. }
  35. public boolean down()
  36. {
  37. switch(direct)
  38. {
  39.                  case 1:if(y<=gTable.y-4)
  40.        {
  41.         store[0]=gTable.myTable[x][y+1];
  42. store[1]=gTable.myTable[x+1][y+3];
  43.         if(isGo(2))
  44.         {
  45. gTable.myTable[x][y]=0;
  46. gTable.myTable[x+1][y]=0;
  47. gTable.myTable[x][y+1]=1;
  48. gTable.myTable[x+1][y+3]=1;
  49. y+=1;
  50. return true;
  51.         }
  52.         else
  53.         {
  54. return false;
  55.        }
  56. }
  57. else
  58. {
  59. return false;
  60. }
  61. case 2:if(y<=gTable.y-3)
  62. {
  63.         store[0]=gTable.myTable[x][y+2];
  64.         store[1]=gTable.myTable[x+1][y+2];
  65. store[2]=gTable.myTable[x+2][y+2];
  66.         if(isGo(3))
  67.         {
  68. gTable.myTable[x+2][y]=0;
  69.          gTable.myTable[x][y+1]=0;
  70. gTable.myTable[x+1][y+1]=0;
  71. gTable.myTable[x][y+2]=1;
  72. gTable.myTable[x+1][y+2]=1;
  73. gTable.myTable[x+2][y+2]=1;
  74. y+=1;
  75. return true;
  76.     }
  77. else
  78. {
  79. return false;
  80. }
  81. }
  82. else
  83. {
  84. return false;
  85. }
  86. case 3:if(y<=gTable.y-4)
  87.        {
  88.         store[0]=gTable.myTable[x][y+3];
  89. store[1]=gTable.myTable[x+1][y+3];
  90.         if(isGo(2))
  91.         {
  92. gTable.myTable[x][y]=0;
  93. gTable.myTable[x+1][y+2]=0;
  94. gTable.myTable[x][y+3]=1;
  95. gTable.myTable[x+1][y+3]=1;
  96. y+=1;
  97. return true;
  98.         }
  99.         else
  100.         {
  101. return false;
  102.        }
  103. }
  104. else
  105. {
  106. return false;
  107. }
  108. case 4:if(y<=gTable.y-3)
  109. {
  110.         store[0]=gTable.myTable[x][y+2];
  111.         store[1]=gTable.myTable[x+1][y+1];
  112. store[2]=gTable.myTable[x+2][y+1];
  113.         if(isGo(3))
  114.         {
  115. gTable.myTable[x][y]=0;
  116.          gTable.myTable[x+1][y]=0;
  117. gTable.myTable[x+2][y]=0;
  118. gTable.myTable[x][y+2]=1;
  119. gTable.myTable[x+1][y+1]=1;
  120. gTable.myTable[x+2][y+1]=1;
  121. y+=1;
  122. return true;
  123.     }
  124. else
  125. {
  126. return false;
  127. }
  128. }
  129. else
  130. {
  131. return false;
  132. }
  133. default:return false;
  134. }
  135. }
  137. public boolean left()
  138. {
  139. switch(direct)
  140. {
  141. case 1:if(x>=1)
  142. {
  143.          store[0]=gTable.myTable[x-1][y];
  144.         store[1]=gTable.myTable[x][y+1];
  145.         store[2]=gTable.myTable[x][y+2];
  146.         if(isGo(3))
  147.         {
  148. gTable.myTable[x+1][y]=0;
  149. gTable.myTable[x+1][y+1]=0;
  150. gTable.myTable[x+1][y+2]=0;
  151. gTable.myTable[x-1][y]=1;
  152. gTable.myTable[x][y+1]=1;
  153. gTable.myTable[x][y+2]=1;
  154. x-=1;
  155. return true;
  156.         }
  157.         else
  158.         {
  159. return false;
  160.       }
  161. }
  162. else
  163. {
  164. return false;
  165. }
  166. case 2:if(x>=1)
  167. {
  168.         store[0]=gTable.myTable[x+1][y];
  169. store[1]=gTable.myTable[x-1][y+1];
  170.         if(isGo(2))
  171.         {
  172. gTable.myTable[x+2][y]=0;
  173. gTable.myTable[x+2][y+1]=0;
  174. gTable.myTable[x+1][y]=1;
  175. gTable.myTable[x-1][y+1]=1;
  176. x-=1;
  177. return true;
  178.     }
  179. else
  180. {
  181. return false;
  182. }
  183. }
  184. else
  185. {
  186. return false;
  187. }
  188. case 3:if(x>=1)
  189. {
  190.          store[0]=gTable.myTable[x-1][y];
  191.         store[1]=gTable.myTable[x-1][y+1];
  192.         store[2]=gTable.myTable[x-1][y+2];
  193.         if(isGo(3))
  194.         {
  195. gTable.myTable[x][y]=0;
  196. gTable.myTable[x][y+1]=0;
  197. gTable.myTable[x+1][y+2]=0;
  198. gTable.myTable[x-1][y]=1;
  199. gTable.myTable[x-1][y+1]=1;
  200. gTable.myTable[x-1][y+2]=1;
  201. x-=1;
  202. return true;
  203.         }
  204.         else
  205.         {
  206. return false;
  207.       }
  208. }
  209. else
  210. {
  211. return false;
  212. }
  213. case 4:if(x>=1)
  214. {
  215.         store[0]=gTable.myTable[x-1][y];
  216. store[1]=gTable.myTable[x-1][y+1];
  217.         if(isGo(2))
  218.         {
  219. gTable.myTable[x][y+1]=0;
  220. gTable.myTable[x+2][y]=0;
  221. gTable.myTable[x-1][y]=1;
  222. gTable.myTable[x-1][y+1]=1;
  223. x-=1;
  224. return true;
  225.     }
  226. else
  227. {
  228. return false;
  229. }
  230. }
  231. else
  232. {
  233. return false;
  234. }
  235. default:return false;
  236. }
  237. }
  239. public boolean right()
  240. {
  241. switch(direct)
  242. {
  243. case 1:if(x<=gTable.x-3)
  244. {
  245.          store[0]=gTable.myTable[x+2][y];
  246.         store[1]=gTable.myTable[x+2][y+1];
  247.         store[2]=gTable.myTable[x+2][y+2];
  248.         if(isGo(3))
  249.         {
  250. gTable.myTable[x][y]=0;
  251. gTable.myTable[x+1][y+1]=0;
  252. gTable.myTable[x+1][y+2]=0;
  253. gTable.myTable[x+2][y]=1;
  254. gTable.myTable[x+2][y+1]=1;
  255. gTable.myTable[x+2][y+2]=1;
  256. x+=1;
  257. return true;
  258.         }
  259.         else
  260.         {
  261. return false;
  262.       }
  263. }
  264. else
  265. {
  266. return false;
  267. }
  268. case 2:if(x<=gTable.x-4)
  269. {
  270.         store[0]=gTable.myTable[x+3][y];
  271. store[1]=gTable.myTable[x+3][y+1];
  272.         if(isGo(2))
  273.         {
  274. gTable.myTable[x+2][y]=0;
  275. gTable.myTable[x][y+1]=0;
  276. gTable.myTable[x+3][y]=1;
  277. gTable.myTable[x+3][y+1]=1;
  278. x+=1;
  279. return true;
  280.     }
  281. else
  282. {
  283. return false;
  284. }
  285. }
  286. else
  287. {
  288. return false;
  289. }
  290. case 3:if(x<=gTable.x-3)
  291. {
  292.          store[0]=gTable.myTable[x+1][y];
  293.         store[1]=gTable.myTable[x+1][y+1];
  294.         store[2]=gTable.myTable[x+2][y+2];
  295.         if(isGo(3))
  296.         {
  297. gTable.myTable[x][y]=0;
  298. gTable.myTable[x][y+1]=0;
  299. gTable.myTable[x][y+2]=0;
  300. gTable.myTable[x+1][y]=1;
  301. gTable.myTable[x+1][y+1]=1;
  302. gTable.myTable[x+2][y+2]=1;
  303. x+=1;
  304. return true;
  305.         }
  306.         else
  307.         {
  308. return false;
  309.       }
  310. }
  311. else
  312. {
  313. return false;
  314. }
  315. case 4:if(x<=gTable.x-4)
  316. {
  317.         store[0]=gTable.myTable[x+3][y];
  318. store[1]=gTable.myTable[x+1][y+1];
  319.         if(isGo(2))
  320.         {
  321. gTable.myTable[x][y]=0;
  322. gTable.myTable[x][y+1]=0;
  323. gTable.myTable[x+3][y]=1;
  324. gTable.myTable[x+1][y+1]=1;
  325. x+=1;
  326. return true;
  327.     }
  328. else
  329. {
  330. return false;
  331. }
  332. }
  333. else
  334. {
  335. return false;
  336. }
  337. default:return false;
  338. }
  339. }
  341. public boolean change()
  342. {
  343. switch(direct)
  344. {
  345. case 1:if(x<=gTable.x-3)
  346. {
  347.          store[0]=gTable.myTable[x][y+1];
  348.         store[1]=gTable.myTable[x][y+2];
  349.         store[2]=gTable.myTable[x+2][y];
  350.         store[3]=gTable.myTable[x+2][y+1];
  351. store[4]=gTable.myTable[x+2][y+2];
  352.         if(isGo(5))
  353.         {
  354. gTable.myTable[x][y]=0;
  355. gTable.myTable[x+1][y]=0;
  356. gTable.myTable[x+1][y+1]=0;
  357. gTable.myTable[x][y+2]=1;
  358. gTable.myTable[x+2][y+1]=1;
  359. gTable.myTable[x+2][y+2]=1;
  360. y+=1;
  361. direct=2;
  362. return true;
  363.         }
  364.         else
  365.         {
  366. return false;
  367.       }
  368. }
  369. else
  370. {
  371. return false;
  372. }
  373. case 2:if(true)
  374. {
  375.         store[0]=gTable.myTable[x][y];
  376.         store[1]=gTable.myTable[x+1][y];
  377.         store[2]=gTable.myTable[x][y-1];
  378.         if(isGo(3))
  379.         {
  380. gTable.myTable[x+2][y]=0;
  381. gTable.myTable[x+2][y+1]=0;
  382. gTable.myTable[x][y]=1;
  383. gTable.myTable[x][y-1]=1;
  384. y-=1;
  385. direct=3;
  386. return true;
  387.     }
  388. else
  389. {
  390. return false;
  391. }
  392. }
  393. else
  394. {
  395. return false;
  396. }
  397. case 3:if(x<=gTable.x-3)
  398. {
  399.          store[0]=gTable.myTable[x+1][y];
  400.         store[1]=gTable.myTable[x+2][y];
  401.         store[2]=gTable.myTable[x+1][y+1];
  402.         store[3]=gTable.myTable[x+2][y+1];
  403.         if(isGo(4))
  404.         {
  405. gTable.myTable[x][y]=0;
  406. gTable.myTable[x+1][y+2]=0;
  407. gTable.myTable[x+1][y+1]=1;
  408. gTable.myTable[x+2][y+1]=1;
  409. y+=1;
  410. direct=4;
  411. return true;
  412.         }
  413.         else
  414.         {
  415. return false;
  416.       }
  417. }
  418. else
  419. {
  420. return false;
  421. }
  422. case 4:if(true)
  423. {
  424.         store[0]=gTable.myTable[x][y-1];
  425.         store[1]=gTable.myTable[x+1][y-1];
  426.         store[2]=gTable.myTable[x+1][y+1];
  427. store[3]=gTable.myTable[x+2][y+1];
  428.         if(isGo(4))
  429.         {
  430. gTable.myTable[x][y]=0;
  431. gTable.myTable[x+2][y]=0;
  432. gTable.myTable[x][y+1]=0;
  433. gTable.myTable[x][y-1]=1;
  434. gTable.myTable[x+1][y-1]=1;
  435. gTable.myTable[x+1][y+1]=1;
  436. y-=1;
  437. direct=1;
  438. return true;
  439.     }
  440. else
  441. {
  442. return false;
  443. }
  444. }
  445. else
  446. {
  447. return false;
  448. }
  449. default:return false;
  450. }
  451. }
  453. public void downTo()
  454. {
  455. boolean canDown=true;
  456. while(canDown)
  457. {
  458. canDown=down();
  459. }
  460. }
  462. public boolean isGo(int n)
  463. {
  464. for(int i=0;i<=(n-1);i++)
  465. {
  466. if(store[i]!=0)
  467. return false;
  468. }
  469. return true;
  470. }
  472. public static void main(String args[])
  473. {
  474. new Six();
  475. }
  476. }