-
Notifications
You must be signed in to change notification settings - Fork 0
/
Model.java
315 lines (280 loc) · 8.12 KB
/
Model.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
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
67
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
import java.util.ArrayList;
import java.util.Arrays;
import javax.swing.event.ChangeEvent;
import javax.swing.event.ChangeListener;
/**
* An object modeling a game of mancala.
* Contains a collection of changelisteners, follows MVC pattern
* @author: Brendon Yim, Bikram Singh, and Jason Chee
* Professor Kim
* CS151
*
* Project solution
* copyright 2015
* version 1
*
*/
public class Model
{
int[] data;
private int[] undoData;
private boolean finish;
public ArrayList<ChangeListener> listeners;
static int player = 1;
int previousPlayer = 2;
boolean undoAllowed ;
int[] undoTurns;
boolean freeTurn;
int undoCounter;
/**
* Constructor for a Model object
*/
public Model()
{
listeners = new ArrayList<ChangeListener>(); //empty ArrayList
data = new int[14]; // initialize to 14, 12 pits and 2 Mancala
undoData = new int[14]; // Auxiliary data structure to save previous state of the game
finish = false; // Indicates when the game is over
undoAllowed = false; // indicates if player has any undo moves left
undoTurns = new int[]{3, 3, 3}; // intialized to 3, for player is allowed 3 undo moves in one turn
freeTurn = false; // indicates if a player has any free turns after he is done with his move
undoCounter = 3; // Auxiliary counter keeps the track of undo moves
}
/**
* Method undo lets the player go to previous state of the game up to 3 times
* per turn and not consecutively
*/
public void undo()
{
if(freeTurn)
{
player++;
player = ((player % 2) != 0) ? 1 : 2 ;
freeTurn = false;
}
if(undoTurns[player] != 0 && undoAllowed)
{
data = Arrays.copyOf(undoData, undoData.length);
undoTurns[player]--;
undoCounter = undoTurns[player];
undoTurns[previousPlayer] = 3;
player = previousPlayer;
player = ((player % 2) != 0) ? 1 : 2 ;
undoAllowed = false;
notifyListeners();
}
}
/**
* Method refreshBoard takes number of stones to initialize the board
*
* @param stones
* of starting stones per pit
*/
public void refreshBoard(int stones)
{
for (int i = 0; i < data.length - 1; i++)
{
data[i] = stones;
if (i == 6)
data[i] = 0;
}
notifyListeners();
}
/**
* accessor method getUndoCounter returns the value of undoCounter
*
* @return value of undoCounter
*/
public int getUndoCounter()
{
return undoCounter;
}
/**Method getFinish returns the value of instance variable finish
* @return true if the game is finish
*/
public boolean getFinish()
{
return finish;
}// end getFinish
/**accessor method getData enables access to instance variable data
* @return data
*/
public int[] getData()
{
return data;
}// end getData
/**method attach is part of MVC which attaches listeners to the Model
* @param c takes change listener as parameter
*/
public void attach(ChangeListener c)
{
listeners.add(c);
}// end attach
/** Method notifyListeners is the notify part of the MVC
* It alerts all the listeners that state of model has been changed.
*/
public void notifyListeners()
{
for (ChangeListener l : listeners)
{
l.stateChanged(new ChangeEvent(this));
}
}// end notifyListeners
/**
* Method move is mutator which listens to pits clicked and mutates the model
*
* @param startPitNum is the value captured by clicking a pit
*/
public void move(int startPitNum)
{
undoAllowed = true;
freeTurn = false;
if (previousPlayer != player)
{
undoCounter = 3;
}
undoData = Arrays.copyOf(data, data.length);
int startIndex = 0;
if ((player == 1) && (startIndex > 6))
startIndex = 6;
if ((player == 2) && (startIndex < 6))
startIndex = 13;
startIndex = startPitNum;
int pitStones = data[startIndex];
System.out.println("\nstartIndex : " + startIndex + " pitStones : "
+ pitStones);
int endIndex = (startIndex + data[startIndex]) % (data.length);
int endIndexData = data[endIndex];
data[startIndex] = 0;
for (int i = startIndex + 1; i <= pitStones + startIndex; i++)
{
int pitNum = i;
if (player == 1 && pitNum == 13)
pitNum++;
if (player == 2 && pitNum == 6)
pitNum++;
if (pitNum >= data.length)
pitNum = pitNum % (data.length);
data[pitNum]++;
}
System.out.println("CurrentPlayer : " + player + " EndIndex : "
+ endIndex);
// If the last stone you drop is your own Mancala, you get a free turn .
if ((endIndex == 6 && player == 1) || (endIndex == 13 && player == 2))
{
System.out.println("You got another Turn!");
// player = player + 1;
undoTurns[player] = 3;
freeTurn = true;
}
// If the last stone you drop is in an empty pit on your side,
// you get to take that stone and all of your opponents stones that are in
// the opposite pit.
// Place all captured stones in your own Mancala.
if (endIndex != 13)
{
if ((endIndexData == 0 && endIndex < 6) && player == 1)
{
if (data[12 - endIndex] != 0)// if opponent's across pit is empty
{
int mancalaStones = 1 + data[12 - endIndex];
data[6] = data[6] + mancalaStones;
data[endIndex] = 0;
data[12 - endIndex] = 0;
}
undoTurns[player] = 3;
}
if ((endIndexData == 0 && endIndex > 6) && player == 2)
{
if (data[12 - endIndex] != 0)
{
int mancalaStones = 1 + data[12 - endIndex];
data[13] = data[13] + mancalaStones;
data[endIndex] = 0;
data[12 - endIndex] = 0;
}
undoTurns[player] = 3;
}
}// harvesting other player's stones
if (isFinish())
{
System.out.println("Game Over!");
declareWinner();
}
previousPlayer = player;
if (freeTurn)
{
// System.out.println("CurrentPlayer updated for free turn.");
player++;
}
player++;
player = ((player % 2) != 0) ? 1 : 2;
notifyListeners();
}// end move
/** Method isFinish check if the game is finished
* @return true if the game is finish
*/
public boolean isFinish()
{
boolean result = false;
int player1Pits = 0;
int player2Pits = 0;
for (int i = 0; i < data.length - 1; i++)
{
if (i < 6)
player1Pits += data[i];
if (i > 6)
player2Pits += data[i];
}
if (player1Pits == 0 || player2Pits == 0)
{
data[6] = data[6] + player1Pits;
data[13] = data[13] + player2Pits;
for (int i = 0; i < data.length - 1; i++)
{
if (i == 6)
;
else
data[i] = 0;
}
result = true;
}
return result;
}
/** Method declareWinner declare the winner after the game is finish
* @return 1 if player 1 wins, 2 if player 2 wins, 3 if tie
*/
public int declareWinner()
{
if (data[6] > data[13])
System.out.println("Player A is the Winner!");
else
System.out.println("Player B is the Winner!");
System.out.println("Player A got : " + data[6] + " stones");
System.out.println("Player B got : " + data[13] + " stones");
// return (data[6] > data[13]) ? 1 : 2;
// add tie condition
if (data[6] > data[13])
{
return 1;
}
if (data[6] < data[13])
{
return 2;
}
return 3;
}
/**Method display the state of board in console for testing puposes.
*
*/
public void display()
{
System.out.println("");
for (int i = 0; i < data.length; i++)
System.out.printf("%02d|", data[i]);
System.out.println("");
for (int i = 0; i < data.length; i++)
System.out.printf("%02d|", i);
System.out.println("");
}
}