?? six.java~5~
字號(hào):
package russiagame;
public class Six extends Root
{
private GameTable gTable;
private int x,y;
private int direct=1;
private int[] store;
public Six()
{
store=new int[15];
}
public boolean begin()
{
if((gTable.myTable[(gTable.x-1)/2][0]==0)&&(gTable.myTable[(gTable.x-1)/2+1][0]==0)&&
(gTable.myTable[(gTable.x-1)/2+1][1]==0)&&(gTable.myTable[(gTable.x-1)/2+1][2]==0))
{
x=(gTable.x-1)/2;
y=0;
gTable.myTable[x][y]=1;
gTable.myTable[x+1][y]=1;
gTable.myTable[x+1][y+1]=1;
gTable.myTable[x+1][y+2]=1;
return true;
}
else
{
return false;
}
}
public boolean down()
{
switch(direct)
{
case 1:if(y<=gTable.y-4)
{
store[0]=gTable.myTable[x][y+1];
store[1]=gTable.myTable[x+1][y+3];
if(isGo(2))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y]=0;
gTable.myTable[x][y+1]=1;
gTable.myTable[x+1][y+3]=1;
y+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 2:if(y<=gTable.y-3)
{
store[0]=gTable.myTable[x][y+2];
store[1]=gTable.myTable[x+1][y+2];
store[2]=gTable.myTable[x+2][y+2];
if(isGo(3))
{
gTable.myTable[x+2][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x+1][y+1]=0;
gTable.myTable[x][y+2]=1;
gTable.myTable[x+1][y+2]=1;
gTable.myTable[x+2][y+2]=1;
y+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 3:if(y<=gTable.y-4)
{
store[0]=gTable.myTable[x][y+3];
store[1]=gTable.myTable[x+1][y+3];
if(isGo(2))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y+2]=0;
gTable.myTable[x][y+3]=1;
gTable.myTable[x+1][y+3]=1;
y+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 4:if(y<=gTable.y-3)
{
store[0]=gTable.myTable[x][y+2];
store[1]=gTable.myTable[x+1][y+1];
store[2]=gTable.myTable[x+2][y+1];
if(isGo(3))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y]=0;
gTable.myTable[x+2][y]=0;
gTable.myTable[x][y+2]=1;
gTable.myTable[x+1][y+1]=1;
gTable.myTable[x+2][y+1]=1;
y+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
default:return false;
}
}
public boolean left()
{
switch(direct)
{
case 1:if(x>=1)
{
store[0]=gTable.myTable[x-1][y];
store[1]=gTable.myTable[x][y+1];
store[2]=gTable.myTable[x][y+2];
if(isGo(3))
{
gTable.myTable[x+1][y]=0;
gTable.myTable[x+1][y+1]=0;
gTable.myTable[x+1][y+2]=0;
gTable.myTable[x-1][y]=1;
gTable.myTable[x][y+1]=1;
gTable.myTable[x][y+2]=1;
x-=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 2:if(x>=1)
{
store[0]=gTable.myTable[x+1][y];
store[1]=gTable.myTable[x-1][y+1];
if(isGo(2))
{
gTable.myTable[x+2][y]=0;
gTable.myTable[x+2][y+1]=0;
gTable.myTable[x+1][y]=1;
gTable.myTable[x-1][y+1]=1;
x-=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 3:if(x>=1)
{
store[0]=gTable.myTable[x-1][y];
store[1]=gTable.myTable[x-1][y+1];
store[2]=gTable.myTable[x-1][y+2];
if(isGo(3))
{
gTable.myTable[x][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x+1][y+2]=0;
gTable.myTable[x-1][y]=1;
gTable.myTable[x-1][y+1]=1;
gTable.myTable[x-1][y+2]=1;
x-=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 4:if(x>=1)
{
store[0]=gTable.myTable[x-1][y];
store[1]=gTable.myTable[x-1][y+1];
if(isGo(2))
{
gTable.myTable[x][y+1]=0;
gTable.myTable[x+2][y]=0;
gTable.myTable[x-1][y]=1;
gTable.myTable[x-1][y+1]=1;
x-=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
default:return false;
}
}
public boolean right()
{
switch(direct)
{
case 1:if(x<=gTable.x-3)
{
store[0]=gTable.myTable[x+2][y];
store[1]=gTable.myTable[x+2][y+1];
store[2]=gTable.myTable[x+2][y+2];
if(isGo(3))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y+1]=0;
gTable.myTable[x+1][y+2]=0;
gTable.myTable[x+2][y]=1;
gTable.myTable[x+2][y+1]=1;
gTable.myTable[x+2][y+2]=1;
x+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 2:if(x<=gTable.x-4)
{
store[0]=gTable.myTable[x+3][y];
store[1]=gTable.myTable[x+3][y+1];
if(isGo(2))
{
gTable.myTable[x+2][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x+3][y]=1;
gTable.myTable[x+3][y+1]=1;
x+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 3:if(x<=gTable.x-3)
{
store[0]=gTable.myTable[x+1][y];
store[1]=gTable.myTable[x+1][y+1];
store[2]=gTable.myTable[x+2][y+2];
if(isGo(3))
{
gTable.myTable[x][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x][y+2]=0;
gTable.myTable[x+1][y]=1;
gTable.myTable[x+1][y+1]=1;
gTable.myTable[x+2][y+2]=1;
x+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 4:if(x<=gTable.x-4)
{
store[0]=gTable.myTable[x+3][y];
store[1]=gTable.myTable[x+1][y+1];
if(isGo(2))
{
gTable.myTable[x][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x+3][y]=1;
gTable.myTable[x+1][y+1]=1;
x+=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
default:return false;
}
}
public boolean change()
{
switch(direct)
{
case 1:if(x<=gTable.x-3)
{
store[0]=gTable.myTable[x][y+1];
store[1]=gTable.myTable[x][y+2];
store[2]=gTable.myTable[x+2][y];
store[3]=gTable.myTable[x+2][y+1];
store[4]=gTable.myTable[x+2][y+2];
if(isGo(5))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y]=0;
gTable.myTable[x+1][y+1]=0;
gTable.myTable[x][y+2]=1;
gTable.myTable[x+2][y+1]=1;
gTable.myTable[x+2][y+2]=1;
y+=1;
direct=2;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 2:if(true)
{
store[0]=gTable.myTable[x][y];
store[1]=gTable.myTable[x+1][y];
store[2]=gTable.myTable[x][y-1];
if(isGo(3))
{
gTable.myTable[x+2][y]=0;
gTable.myTable[x+2][y+1]=0;
gTable.myTable[x][y]=1;
gTable.myTable[x][y-1]=1;
y-=1;
direct=3;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 3:if(x<=gTable.x-3)
{
store[0]=gTable.myTable[x+1][y];
store[1]=gTable.myTable[x+2][y];
store[2]=gTable.myTable[x+1][y+1];
store[3]=gTable.myTable[x+2][y+1];
if(isGo(4))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+1][y+2]=0;
gTable.myTable[x+1][y+1]=1;
gTable.myTable[x+2][y+1]=1;
y+=1;
direct=4;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
case 4:if(true)
{
store[0]=gTable.myTable[x][y-1];
store[1]=gTable.myTable[x+1][y-1];
store[2]=gTable.myTable[x+1][y+1];
store[3]=gTable.myTable[x+2][y+1];
if(isGo(4))
{
gTable.myTable[x][y]=0;
gTable.myTable[x+2][y]=0;
gTable.myTable[x][y+1]=0;
gTable.myTable[x][y-1]=1;
gTable.myTable[x+1][y-1]=1;
gTable.myTable[x+1][y+1]=1;
y-=1;
direct=1;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
default:return false;
}
}
public void downTo()
{
boolean canDown=true;
down();
/* while(canDown)
{
canDown=down();
}*/
}
public boolean isGo(int n)
{
for(int i=0;i<=(n-1);i++)
{
if(store[i]!=0)
return false;
}
return true;
}
public static void main(String args[])
{
new Six();
}
}?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -