2048 的核心規則其實不複雜:一個二維陣列作為棋盤,階數為 matrix,每次滑動先做「去空格」,再做「同值合併」。以下把這套邏輯封裝成一個 Algorithm 類別。
// .h @class DataModel; @interface Algorithm : NSObject @property (nonatomic, assign) int addScore; // 本回合加分 - (void)caculateTop:(DataModel *)model; // 上滑 - (void)caculateBottom:(DataModel *)model; // 下滑 - (void)caculateLeft:(DataModel *)model; // 左滑 - (void)caculateRight:(DataModel *)model; // 右滑 - (BOOL)randNewOne:(DataModel *)data; // 隨機產生新方塊 - (int)getAddScore; @end
// .m
@implementation Algorithm
#pragma mark - 滑動入口
- (void)caculateTop:(DataModel *)model { [self up_remove_blank:model]; [self up:model]; }
- (void)caculateBottom:(DataModel *)model { [self down_remove_blank:model]; [self down:model]; }
- (void)caculateLeft:(DataModel *)model { [self left_remove_blank:model]; [self left:model]; }
- (void)caculateRight:(DataModel *)model { [self right_remove_blank:model]; [self right:model]; }
- (int)getAddScore {
int temp = _addScore;
_addScore = 0; // 讀取後歸零,避免分數重複累加
return temp;
}
#pragma mark - 隨機產生新方塊
- (BOOL)randNewOne:(DataModel *)model {
array data = [model getData];
int all = 0;
for (int i = 0; i < model.matrix; i++)
for (int j = 0; j < model.matrix; j++)
if (data[i][j] == 0) all++;
if (all == 0) return NO; // 棋盤已滿,無法再產生
int index = arc4random() % all;
all = 0;
for (int i = 0; i < model.matrix; i++) {
for (int j = 0; j < model.matrix; j++) {
if (data[i][j] == 0) {
all++;
if (all == index + 1) {
data[i][j] = 2;
return YES;
}
}
}
}
return NO;
}
#pragma mark - 去空格(四個方向)
- (void)up_remove_blank:(DataModel *)model {
array data = [model getData];
int i, j, k;
for (j = 0; j < model.matrix; j++) {
for (i = 1; i < model.matrix; i++) {
k = i;
while (k - 1 >= 0 && data[k-1][j] == 0) { // 上方為空則往上搬
int temp = data[k][j];
data[k][j] = data[k-1][j];
data[k-1][j] = temp;
k--;
}
}
}
}
- (void)down_remove_blank:(DataModel *)model {
array data = [model getData];
int i, j, k;
for (j = 0; j < model.matrix; j++) {
for (i = model.matrix - 2; i >= 0; i--) {
k = i;
while (k + 1 <= model.matrix - 1 && data[k+1][j] == 0) {
int temp = data[k][j];
data[k][j] = data[k+1][j];
data[k+1][j] = temp;
k++;
}
}
}
}
- (void)left_remove_blank:(DataModel *)model {
array data = [model getData];
int i, j, k;
for (i = 0; i < model.matrix; i++) {
for (j = 1; j < model.matrix; j++) {
k = j;
while (k - 1 >= 0 && data[i][k-1] == 0) {
int temp = data[i][k];
data[i][k] = data[i][k-1];
data[i][k-1] = temp;
k--;
}
}
}
}
- (void)right_remove_blank:(DataModel *)model {
array data = [model getData];
int i, j, k;
for (i = 0; i < model.matrix; i++) {
for (j = model.matrix - 2; j >= 0; j--) {
k = j;
while (k + 1 <= model.matrix - 1 && data[i][k+1] == 0) {
int temp = data[i][k];
data[i][k] = data[i][k+1];
data[i][k+1] = temp;
k++;
}
}
}
}
#pragma mark - 同值合併
- (void)left:(DataModel *)model {
array data = [model getData];
int i, j;
for (i = 0; i < model.matrix; i++) {
for (j = 0; j < model.matrix - 1; j++) {
if (data[i][j] == data[i][j+1]) {
_addScore += data[i][j];
data[i][j] += data[i][j+1];
data[i][j+1] = 0;
[self left_remove_blank:model]; // 合併後立刻補位
}
}
}
}
- (void)right:(DataModel *)model {
array data = [model getData];
int i, j;
for (i = 0; i < model.matrix; i++) {
for (j = model.matrix - 1; j >= 1; j--) {
if (data[i][j] == data[i][j-1]) {
_addScore += data[i][j];
data[i][j] += data[i][j-1];
data[i][j-1] = 0;
[self right_remove_blank:model];
}
}
}
}
- (void)up:(DataModel *)model {
array data = [model getData];
int i, j;
for (j = 0; j < model.matrix; j++) { // 逐列處理
for (i = 0; i < model.matrix - 1; i++) {
if (data[i][j] == data[i+1][j]) {
_addScore += data[i][j];
data[i][j] = data[i][j] + data[i+1][j];
data[i+1][j] = 0;
[self up_remove_blank:model];
}
}
}
}
- (void)down:(DataModel *)model {
array data = [model getData];
int i, j;
for (j = 0; j < model.matrix; j++) {
for (i = model.matrix - 1; i >= 1; i--) {
if (data[i][j] == data[i-1][j]) {
_addScore += data[i][j];
data[i][j] = data[i][j] + data[i-1][j];
data[i-1][j] = 0;
[self down_remove_blank:model];
}
}
}
}
@end
設計上的關鍵是「先去空格、再合併」的順序,以及合併後立刻再補一次位,這樣連續相同的數字才不會在一次滑動中被重複合併。實作時若把 array 換成 int ** 並自行配置二維記憶體,別忘了在 dealloc 時逐列釋放。