-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEngine.cs
More file actions
254 lines (223 loc) · 6.78 KB
/
Engine.cs
File metadata and controls
254 lines (223 loc) · 6.78 KB
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
using System;
using System.Collections.Generic;
namespace GameOf2048
{
public class Engine
{
public Boolean SpawnNumber(int[][] board)
{
// Spawn a 2 or 4 on a random empty field
List<int[]> empty_tiles = new List<int[]>();
for (int i = 0; i < board.Length; i++)
{
for (int j = 0; j < board[i].Length; j++)
{
if (board[i][j] == 0)
{
empty_tiles.Add(new int[] { i, j });
}
}
}
if (empty_tiles.Count > 0)
{
Random rnd = new Random();
int index = rnd.Next(0, empty_tiles.Count);
int number = rnd.Next(1, 10) < 9 ? 2 : 4;
board[empty_tiles[index][0]][empty_tiles[index][1]] = number;
return true;
}
else
{
return false;
}
}
public int ExecuteMove(Moves move, int[][] board)
{
int mergedValue = 0;
int[][] prevBoard = CopyBoard(board);
switch (move)
{
case Moves.UP:
mergedValue = MergeUp(board);
break;
case Moves.DOWN:
mergedValue = MergeDown(board);
break;
case Moves.LEFT:
mergedValue = MergeLeft(board);
break;
case Moves.RIGHT:
mergedValue = MergeRight(board);
break;
}
// The move is only valid if the state of the board has changed.
if (BoardEquals(prevBoard, board))
return -1;
else
return mergedValue;
}
public Boolean NoMovesPossible(int[][] board)
{
var mergedValue = -1;
foreach (Moves move in Enum.GetValues(typeof(Moves)))
{
int[][] tmpBoard = CopyBoard(board);
mergedValue = Math.Max(mergedValue, ExecuteMove((Moves)move, tmpBoard));
}
return mergedValue < 0;
}
public Boolean MovePossible(Moves move, int[][] board)
{
int[][] newBoard = CopyBoard(board);
ExecuteMove(move, newBoard);
return !BoardEquals(newBoard, board);
}
public static Boolean BoardEquals(int[][] boardA, int[][] boardB)
{
for (int i = 0; i < boardA.Length; i++)
{
for (int j = 0; j < boardA[i].Length; j++)
{
if (boardA[i][j] != boardB[i][j])
return false;
}
}
return true;
}
public static int[][] CopyBoard(int[][] source)
{
int[][] dest = new int[source.Length][];
for (int i = 0; i < source.Length; i++)
{
dest[i] = (int[])source[i].Clone();
}
return dest;
}
private int MergeLeft(int[][] board)
{
int merged = 0;
for (int i = 0; i < board.Length; i++)
{
merged += MergeLeftRow(board[i], 0);
}
return merged;
}
private int MergeRight(int[][] board)
{
// reverse so we can merge left
for (int i = 0; i < board.Length; i++)
{
Array.Reverse(board[i]);
}
var merged = MergeLeft(board);
// reverse again
for (int i = 0; i < board.Length; i++)
{
Array.Reverse(board[i]);
}
return merged;
}
private int MergeUp(int[][] board)
{
RotateCCW(board);
var merged = MergeLeft(board);
RotateCW(board);
return merged;
}
private int MergeDown(int[][] board)
{
RotateCW(board);
var merged = MergeLeft(board);
RotateCCW(board);
return merged;
}
private int MergeLeftRow(int[] row, int merged)
{
ShiftLeft(row);
int initMerged = merged;
for (int i = 0; i < row.Length - 1; i++)
{
int x = row[i];
if (x == row[i + 1])
{
x *= 2;
merged += x;
row[i] = x;
row[i + 1] = 0;
}
}
if (initMerged == merged)
{
return merged;
}
else
{
return MergeLeftRow(row, merged);
}
}
private void ShiftLeft(int[] row)
{
int zeroCount = 0;
for (int i = 0; i < row.Length; i++)
{
if (row[i] == 0)
{
// count how many times the row has to be shifted left
zeroCount++;
}
else if (zeroCount > 0)
{
// reset main counter
i = i - zeroCount;
// shift array n times
for (int j = i; j < row.Length - zeroCount; j++)
{
row[j] = row[j + zeroCount];
row[j + zeroCount] = 0;
}
zeroCount = 0;
}
}
}
private void RotateCW(int[][] board)
{
int n = board.Length;
int[][] tmpBoard = new int[4][];
tmpBoard[0] = new int[4];
tmpBoard[1] = new int[4];
tmpBoard[2] = new int[4];
tmpBoard[3] = new int[4];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
tmpBoard[i][j] = board[n - j - 1][i];
}
}
for (int i = 0; i < n; i++)
{
board[i] = tmpBoard[i];
}
}
private void RotateCCW(int[][] board)
{
int n = board.Length;
int[][] tmpBoard = new int[4][];
tmpBoard[0] = new int[4];
tmpBoard[1] = new int[4];
tmpBoard[2] = new int[4];
tmpBoard[3] = new int[4];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
tmpBoard[i][j] = board[j][n - i - 1];
}
}
for (int i = 0; i < n; i++)
{
board[i] = tmpBoard[i];
}
}
}
}