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

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

Java编程

开发平台：

Java

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