-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtwin.c
171 lines (158 loc) · 3 KB
/
twin.c
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
#include "twin.h"
extern struct field field[XMAX][YMAX];
static int in_twin_grid(int x, int y, int dir)
{
switch (dir) {
case 1:
if ((x >= 0) && (x+1 < XMAX))
return 1;
break;
case -1:
if ((x < XMAX) && (x-1 >= 0))
return 1;
break;
case 12:
if ((y >= 0) && (y+1 < YMAX))
return 1;
break;
case -12:
if ((y < YMAX) && (y-1 >= 0))
return 1;
break;
}
return 0;
}
static int in_split_grid(int x, int y, int dir)
{
switch (dir) {
case 1:
if ((x >= 0) && (x+2 < XMAX))
return 1;
break;
case -1:
if ((x < XMAX) && (x-2 >= 0))
return 1;
break;
case 12:
if ((y >= 0) && (y+2 < YMAX))
return 1;
break;
case -12:
if ((y < YMAX) && (y-2 >= 0))
return 1;
break;
}
return 0;
}
static int is_twin(int x, int y, int dir)
{
if (!in_twin_grid(x, y, dir))
return 0;
if (field[x][y].value == -1)
return 0;
switch (dir) {
case 1:
if (field[x][y].value == field[x+1][y].value)
return 1;
break;
case -1:
if (field[x][y].value == field[x-1][y].value)
return 1;
break;
case 12:
if (field[x][y].value == field[x][y+1].value)
return 1;
break;
case -12:
if (field[x][y].value == field[x][y-1].value)
return 1;
break;
}
return 0;
}
static int is_split(int x, int y, int dir)
{
if (!in_split_grid(x, y, dir))
return 0;
if (field[x][y].value == -1)
return 0;
switch (dir) {
case 1:
if (field[x][y].value == field[x+2][y].value)
return 1;
break;
case -1:
if (field[x][y].value == field[x-2][y].value)
return 1;
break;
case 12:
if (field[x][y].value == field[x][y+2].value)
return 1;
break;
case -12:
if (field[x][y].value == field[x][y-2].value)
return 1;
break;
}
return 0;
}
static void bind_twin(int x, int y, int dir)
{
switch (dir) {
case 1:
if (((x < XMAX) && (x > 0)) && (field[x-1][y].value == -1))
field[x-1][y].value = !(field[x][y].value);
break;
case -1:
if (((x >= 0) && (x < XMAX-1)) && (field[x+1][y].value == -1))
field[x+1][y].value = !(field[x][y].value);
break;
case 12:
if ((y > 0) && (field[x][y-1].value == -1))
field[x][y-1].value = !(field[x][y].value);
break;
case -12:
if ((y < YMAX-1) && (field[x][y+1].value == -1))
field[x][y+1].value = !(field[x][y].value);
break;
}
}
static void split_twin(int x, int y, int dir)
{
switch(dir) {
case 1:
field[x+1][y].value = !(field[x][y].value);
break;
case -1:
field[x-1][y].value = !(field[x][y].value);
break;
case 12:
field[x][y+1].value = !(field[x][y].value);
break;
case -12:
field[x][y-1].value = !(field[x][y].value);
break;
}
}
int check_twin(int dir)
{
int x,y;
for (y=0; y<YMAX; y++) {
for (x=0; x<XMAX; x++) {
if (is_twin(x, y, dir))
bind_twin(x, y, dir);
}
}
return 0;
}
int check_split(int dir)
{
int x,y;
for (y=0; y<YMAX; y++) {
for (x=0; x<XMAX; x++) {
if (is_split(x, y, dir))
split_twin(x, y, dir);
}
}
return 0;
}