Package com.gardeneaters.game_v0.playingfield

Examples of com.gardeneaters.game_v0.playingfield.Mushroom

7
8
9
10
11
12
13
14
15
16
17
  Autoplay autoplay;
 
  protected Level(Hexagon[][] hexagons){
    int [] teams = {2,3};
    autoplay = new Autoplay(hexagons, teams);
   
    //activateHex(hexagons[10][10], 1);
//    for(int i=10; i<16; i++)
//    {
//      for(int j=6; j<12; j++)
View Full Code Here
8
9
10
11
12
13
14
15
16
  Garden garden;
  Path path;
  Level level;
 
  public Play(Context2d context) {
    garden = new Garden(context);
    path = new Path(garden.getHexagons());
    level = new Level(garden.getHexagons());
  }
View Full Code Here
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
  }
 
  protected boolean isInLoop(int i, int j) {
    boolean isInLoop = false;
   
    Hexagon tempHex;
    int pointingTo;
    int[] nextPos = new int[2];
    int team = hexagons[i][j].getTeam();
    nextPos[0]=i;
    nextPos[1]=j;
    do{
      hexagons[nextPos[0]][nextPos[1]].calculating=true;
      pointingTo = hexagons[nextPos[0]][nextPos[1]].getPointingTo();
      tempHex = getHexagon(pointingTo,nextPos[0], nextPos[1]);
      if(tempHex==null)// accommodates pointingTo==0 condition and also edge of grid.
      {
      //  System.out.println("yoo"+i+" "+j);
        nextPos[0]=-1;
        nextPos[1]=-1;
        break;
      }
      else if(tempHex.getTeam()!= team)// when team changes
      {
      //  System.out.println("yo"+i+" "+j+" team "+hexagons[i][j].getTeam()+" "+team);
      //  System.out.println("nextPos "+nextPos[0]+" "+nextPos[1]);
      //  nextPos = getHexagonPos(pointingTo,nextPos[0], nextPos[1]);
      //  System.out.println("nextPos2 "+nextPos[0]+" "+nextPos[1]+" team "+tempHex.getTeam()+" "+hexagons[nextPos[0]][nextPos[1]].getTeam());
        nextPos[0]=-1;
        nextPos[1]=-1;
        break;
      }
      nextPos = getHexagonPos(pointingTo,nextPos[0], nextPos[1]);
    }while(!hexagons[nextPos[0]][nextPos[1]].calculating);
   
    if(nextPos[0]==i && nextPos[1]==j)
      isInLoop = true;
   
    nextPos[0]=i;
    nextPos[1]=j;
    do{
      hexagons[nextPos[0]][nextPos[1]].calculating=false;
      pointingTo = hexagons[nextPos[0]][nextPos[1]].getPointingTo();
      tempHex = getHexagon(pointingTo, nextPos[0], nextPos[1]);
      if(tempHex==null)// accommodates pointingTo==0 condition and also edge of grid.
        break;
      else if(tempHex.getTeam()!= hexagons[i][j].getTeam())// when team changes
        break;
      nextPos = getHexagonPos(pointingTo,nextPos[0], nextPos[1]);
    }while(hexagons[nextPos[0]][nextPos[1]].calculating);
   
    return isInLoop;
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
  }
 
  protected boolean isPointingAtMe(int side, int i, int j){
    if(side ==0 )
      return false;
    Hexagon tempHex=null;
    try{
    tempHex = getHexagon(side, i, j);
    }catch(Exception e){
      tempHex=null;
      return false;
    }
    if(tempHex==null)
      return false;
   
    int pointingTo = tempHex.getPointingTo();
    if(side == getHexOppositeSide(pointingTo))
      return true;
//    if((pointingTo==1 && side==4) || (pointingTo==4 && side==1))
//      return true;
//    else if((pointingTo==2 && side ==5) || (pointingTo==5 && side ==2))
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
  }
 
  protected boolean isUnderAttack(int i, int j){
   
    int team = hexagons[i][j].getTeam();
    Hexagon tempHex;
    for(int k =1; k<7; k++)
    {
      if(isPointingAtMe(k,i,j) )// calls overloaded method
      {
        tempHex = getHexagon(k, i, j);
        if(tempHex.getTeam()!=team)
          return true;
      }
    }
    return false;
  }
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
    return false;
  }
 
  protected Hexagon getHexagon(int side, int i, int j)
  {//i,j is actually hexagon[i][j]
    Hexagon tempHex = null;
    int [] tempPos = getHexagonPos(side,i,j);
    if(tempPos==null)
      tempHex = null;
    else
      try{
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
     
    //power of all heads has been calculated..
    // now re-calculate power of those hex which are under attack
    // hexagons can be attacked by heads only
    int pointingTo;
    Hexagon tempHex;
    int [] tempPos;
    for(int i=0; i<headPositions.size(); i++)
    {
      temp = headPositions.elementAt(i);
      pointingTo = hexagons[temp[0]][temp[1]].getPointingTo();
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
  }

  private void reCalculatePower(int i, int j) {
    // re-calculates power of hex which is under attack
    //System.out.println("recalculationg for "+i+" "+j);
    Hexagon tempHex;
    int team = hexagons[i][j].getTeam();
   
    Vector <PowerCalculator> powerVector = new Vector<PowerCalculator>();
    PowerCalculator tempPowCal;
    int teamPos;
    for(int k=0; k<7; k++)
    {
      if(isPointingAtMe(k, i, j))
      {
        tempHex = getHexagon(k, i, j);
        if(tempHex.getTeam() != team)
        {
          teamPos=-1;
          for(int l =0; l<powerVector.size(); l++)
          {
            if(powerVector.elementAt(l).getTeam()==tempHex.getTeam())
              teamPos = l;
          }
         
          if(teamPos==-1)
          {
            tempPowCal = new PowerCalculator(tempHex.getTeam());
            powerVector.add(tempPowCal);
          }
          else
          {
            tempPowCal = powerVector.elementAt(teamPos);
          }
         
          tempPowCal.addHex(tempHex.getCurrentPow());
         
        }
      }
    }
   
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
  private boolean isPathHead(int i, int j){
   
    boolean isHead = false;
    int pointingTo = hexagons[i][j].getPointingTo();
    Hexagon tempHex = getHexagon(pointingTo,i,j);
   
    if(tempHex==null && pointingTo!=0)// for edges of grid
      return true;
    //|| tempHex.getTeam()!= hexagons[i][j].getTeam()
   
    if(pointingTo==0)// for no team hex pointingTo is always zero but not vice versa
    {
      if(hexagons[i][j].getTeam()!=0)// for single existing team hexagon pointing nowhere
        isHead = true;
      else
        isHead = isPointingAtMe(i,j);// for hexagon with no team and is under attack
    }
    else if(pointingTo!=0)
    {
      if(tempHex.getTeam()!= hexagons[i][j].getTeam())// for opposite team and may be also for no-team hexagon
      {
        isHead = true;
      }
      else// runs if team is same // its for circular loop head
      {
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
  }
 
  private boolean isCircularLoopHead(int i, int j){
    boolean isInLoop = false;
   
    Hexagon tempHex;
    int pointingTo;
    int[] nextPos = new int[2];
    int team = hexagons[i][j].getTeam();
    nextPos[0]=i;
    nextPos[1]=j;
    do{
      hexagons[nextPos[0]][nextPos[1]].calculating=true;
      pointingTo = hexagons[nextPos[0]][nextPos[1]].getPointingTo();
      tempHex = getHexagon(pointingTo,nextPos[0], nextPos[1]);
      if(tempHex==null)// accommodates pointingTo==0 condition and also edge of grid.
      {
        nextPos[0]=-1;
        nextPos[1]=-1;
        break;
      }
      else if(tempHex.getTeam()!= team)// when team changes
      {
        nextPos[0]=-1;
        nextPos[1]=-1;
        break;
      }
      nextPos = getHexagonPos(pointingTo,nextPos[0], nextPos[1]);
    }while(!hexagons[nextPos[0]][nextPos[1]].calculating);
   
    if(nextPos[0]==i && nextPos[1]==j)
      isInLoop = true;

    int [] temp;
    nextPos[0]=i;
    nextPos[1]=j;
    do{
      hexagons[nextPos[0]][nextPos[1]].calculating=false;
      if(isInLoop)// when another element of loop already exists in headPositions vector
      {
       
        for(int k=0; k<headPositions.size(); k++)
        {
          temp = headPositions.elementAt(k);
          if(nextPos[0]==temp[0] && nextPos[1]==temp[1])
          {
            isInLoop=false;
            //System.out.println("isINLoopHead said False");
            break;
          }
        }
      }
     
      pointingTo = hexagons[nextPos[0]][nextPos[1]].getPointingTo();
      tempHex = getHexagon(pointingTo, nextPos[0], nextPos[1]);
      if(tempHex==null)// accommodates pointingTo==0 condition and also edge of grid.
        break;
      else if(tempHex.getTeam()!= team)// when team changes
        break;
      nextPos = getHexagonPos(pointingTo,nextPos[0], nextPos[1]);
    }while(hexagons[nextPos[0]][nextPos[1]].calculating);
   
    return isInLoop;
View Full Code Here
TOP

Related Classes of com.gardeneaters.game_v0.playingfield.Mushroom

  • com.gardeneaters.game_v0.autoplay.Autoplay
  • com.gardeneaters.game_v0.client.GardenEaters
  • com.gardeneaters.game_v0.playingfield.Garden
  • com.gardeneaters.game_v0.playingfield.Hexagon
  • com.gardeneaters.game_v0.rules.Head
  • com.gardeneaters.game_v0.rules.Hexagons
  • com.gardeneaters.game_v0.rules.Level
  • com.gardeneaters.game_v0.rules.Play
  • com.gardeneaters.game_v0.rules.Power
  • com.google.gwt.canvas.client.Canvas
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.