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

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

Java编程

开发平台：

Java

Three.java：源码内容
  1. package russiagame;
  3. public class Three extends Root
  4. {
  5. private GameTable gTable;
  6. private int x,y;
  7. private int direct=1;
  8. private int[] store;
  13. public Three()
  14. {
  15. store=new int[15];
  16. }
  18. public boolean begin()
  19. {
  20. if((gTable.myTable[(gTable.x-1)/2][1]==0)&&(gTable.myTable[(gTable.x-1)/2][2]==0)&&
  21. (gTable.myTable[(gTable.x-1)/2+1][0]==0)&&(gTable.myTable[(gTable.x-1)/2+1][1]==0))
  22. {
  23. x=(gTable.x-1)/2;
  24. y=0;
  25. gTable.myTable[x][y+1]=1;
  26. gTable.myTable[x][y+2]=1;
  27. gTable.myTable[x+1][y]=1;
  28. gTable.myTable[x+1][y+1]=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+3];
  44. store[1]=gTable.myTable[x+1][y+2];
  45.         if(isGo(2))
  46.         {
  47. gTable.myTable[x][y+1]=0;
  48. gTable.myTable[x+1][y]=0;
  49. gTable.myTable[x][y+3]=1;
  50. gTable.myTable[x+1][y+2]=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+1];
  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][y]=0;
  71.          gTable.myTable[x+1][y]=0;
  72. gTable.myTable[x+2][y+1]=0;
  73. gTable.myTable[x][y+1]=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. default:return false;
  89. }
  90. }
  92. public boolean left()
  93. {
  94. switch(direct)
  95. {
  96. case 1:if(x>=1)
  97. {
  98.          store[0]=gTable.myTable[x][y];
  99.         store[1]=gTable.myTable[x-1][y+1];
  100.         store[2]=gTable.myTable[x-1][y+2];
  101.         if(isGo(3))
  102.         {
  103. gTable.myTable[x+1][y]=0;
  104. gTable.myTable[x+1][y+1]=0;
  105. gTable.myTable[x][y+2]=0;
  106. gTable.myTable[x][y]=1;
  107. gTable.myTable[x-1][y+1]=1;
  108. gTable.myTable[x-1][y+2]=1;
  109. x-=1;
  110. return true;
  111.         }
  112.         else
  113.         {
  114. return false;
  115.       }
  116. }
  117. else
  118. {
  119. return false;
  120. }
  121. case 2:if(x>=1)
  122. {
  123.         store[0]=gTable.myTable[x-1][y];
  124. store[1]=gTable.myTable[x][y+1];
  125.         if(isGo(2))
  126.         {
  127. gTable.myTable[x+1][y]=0;
  128. gTable.myTable[x+2][y+1]=0;
  129. gTable.myTable[x-1][y]=1;
  130. gTable.myTable[x][y+1]=1;
  131. x-=1;
  132. return true;
  133.     }
  134. else
  135. {
  136. return false;
  137. }
  138. }
  139. else
  140. {
  141. return false;
  142. }
  143. default:return false;
  144. }
  145. }
  147. public boolean right()
  148. {
  149. switch(direct)
  150. {
  151. case 1:if(x<=gTable.x-3)
  152. {
  153.          store[0]=gTable.myTable[x+2][y];
  154.         store[1]=gTable.myTable[x+2][y+1];
  155.         store[2]=gTable.myTable[x+1][y+2];
  156.         if(isGo(3))
  157.         {
  158. gTable.myTable[x][y+1]=0;
  159. gTable.myTable[x][y+2]=0;
  160. gTable.myTable[x+1][y]=0;
  161. gTable.myTable[x+2][y]=1;
  162. gTable.myTable[x+2][y+1]=1;
  163. gTable.myTable[x+1][y+2]=1;
  164. x+=1;
  165. return true;
  166.         }
  167.         else
  168.         {
  169. return false;
  170.       }
  171. }
  172. else
  173. {
  174. return false;
  175. }
  176. case 2:if(x<=gTable.x-4)
  177. {
  178.         store[0]=gTable.myTable[x+2][y];
  179. store[1]=gTable.myTable[x+3][y+1];
  180.         if(isGo(2))
  181.         {
  182. gTable.myTable[x][y]=0;
  183. gTable.myTable[x+1][y+1]=0;
  184. gTable.myTable[x+2][y]=1;
  185. gTable.myTable[x+3][y+1]=1;
  186. x+=1;
  187. return true;
  188.     }
  189. else
  190. {
  191. return false;
  192. }
  193. }
  194. else
  195. {
  196. return false;
  197. }
  198. default:return false;
  199. }
  200. }
  202. public boolean change()
  203. {
  204. switch(direct)
  205. {
  206. case 1:if(x<=gTable.x-3)
  207. {
  208.          store[0]=gTable.myTable[x+2][y];
  209.         store[1]=gTable.myTable[x+2][y+1];
  210.         store[2]=gTable.myTable[x+2][y+2];
  211.         store[3]=gTable.myTable[x+2][y+3];
  212. store[4]=gTable.myTable[x+1][y+2];
  213. store[5]=gTable.myTable[x+1][y+3];
  214.         if(isGo(6))
  215.         {
  216. gTable.myTable[x][y+1]=0;
  217. gTable.myTable[x+1][y]=0;
  218. gTable.myTable[x+1][y+1]=0;
  219. gTable.myTable[x+1][y+2]=1;
  220. gTable.myTable[x+1][y+3]=1;
  221. gTable.myTable[x+2][y+3]=1;
  222. y+=2;
  223. direct=2;
  224. return true;
  225.         }
  226.         else
  227.         {
  228. return false;
  229.       }
  230. }
  231. else
  232. {
  233. return false;
  234. }
  235. case 2:if(true)
  236. {
  237.         store[0]=gTable.myTable[x+2][y];
  238.         store[1]=gTable.myTable[x][y-1];
  239.         store[2]=gTable.myTable[x+1][y-1];
  240.         store[3]=gTable.myTable[x+2][y-1];
  241. store[4]=gTable.myTable[x+1][y-2];
  242. store[5]=gTable.myTable[x+2][y-2];
  243.         if(isGo(6))
  244.         {
  245. gTable.myTable[x+1][y]=0;
  246. gTable.myTable[x+1][y+1]=0;
  247. gTable.myTable[x+2][y+1]=0;
  248. gTable.myTable[x][y-1]=1;
  249. gTable.myTable[x+1][y-1]=1;
  250. gTable.myTable[x+1][y-2]=1;
  251. y-=2;
  252. direct=1;
  253. return true;
  254.     }
  255. else
  256. {
  257. return false;
  258. }
  259. }
  260. else
  261. {
  262. return false;
  263. }
  264. default:return false;
  265. }
  266. }
  268. public void downTo()
  269. {
  270. boolean canDown=true;
  271. while(canDown)
  272. {
  273. canDown=down();
  274. }
  275. }
  277. public boolean isGo(int n)
  278. {
  279. for(int i=0;i<=(n-1);i++)
  280. {
  281. if(store[i]!=0)
  282. return false;
  283. }
  284. return true;
  285. }
  287. public static void main(String args[])
  288. {
  289. new Three();
  290. }
  291. }