今天给大家带来的是一块用wpf 实现魔方的小游戏，先看一下效果图
代码如下，先写一个类，用来判断是否可以移动
|
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
|
using system;
using system.collections.generic;
using system.linq;
using system.text;
namespace _0705
{
class classway
{
public classway(int num)
{
if (num < 9 || (num > 17 && num < 27) || num > 35)
{
if (num % 3 == 0)
{
ist1 = true;
}
if (num % 3 == 1)
{
ist2 = true;
}
if (num % 3 == 2)
{
ist3 = true;
}
}
if (num > 8 && num < 36)
{
if (num < 12 || (num > 17 && num < 21) || (num > 26 && num < 30))
{
isl1 = true;
}
else
if ((num > 11 && num < 15) || (num > 20 && num < 24) || (num > 29 && num < 33))
{
isl2 = true;
}
else
{
isl3 = true;
}
}
}
int num;
public int num
{
get { return num; }
set { num = value; }
}
bool ist1;
public bool ist1
{
get { return ist1; }
set { ist1 = value; }
}
bool ist2;
public bool ist2
{
get { return ist2; }
set { ist2 = value; }
}
bool ist3;
public bool ist3
{
get { return ist3; }
set { ist3 = value; }
}
bool isl1;
public bool isl1
{
get { return isl1; }
set { isl1 = value; }
}
bool isl2;
public bool isl2
{
get { return isl2; }
set { isl2 = value; }
}
bool isl3;
public bool isl3
{
get { return isl3; }
set { isl3 = value; }
}
}
}
|
下面是主函数的代码
|
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
|
using system;
using system.collections.generic;
using system.linq;
using system.text;
using system.windows;
using system.windows.controls;
using system.windows.data;
using system.windows.documents;
using system.windows.input;
using system.windows.media;
using system.windows.media.imaging;
using system.windows.navigation;
using system.windows.shapes;
namespace _0705
{
/// <summary>
/// mainwindow.xaml 的交互逻辑
/// </summary>
public partial class mainwindow : window
{
random r = new random();
int[] num = new int[45];
classway[] cw = new classway[45];
image[] imgall = new image[45];
list<image> imgmmove = new list<image>();
public mainwindow()
{
initializecomponent();
this.width = systemparameters.fullprimaryscreenwidth;
this.height = systemparameters.fullprimaryscreenheight;
this.left = 0;
this.top = 0;
this.windowstyle = system.windows.windowstyle.none;
this.allowstransparency = true;
this.background = brushes.transparent;
for (int i = 0; i < 45; i++)
{
num[i] = r.next(1, 6);
int temp = 0;
for (int j = 0; j < i; j++)
{
if (num[i] == num[j])
{
temp++;
if (temp == 9)
{
i--;
break;
}
}
}
}
for (int i = 0; i < 45; i++)
{
cw[i] = new classway(i);
cw[i].num = num[i];
//image img = new image();
imgall[i] = new image();
imgall[i].tag = i;
imgall[i].width = 50;
imgall[i].height = 50;
imgall[i].source = new bitmapimage(new uri("images/" + num[i] + ".png", urikind.relative));
back.children.add(imgall[i]);
if (i < 9)
{
canvas.setleft(imgall[i], 480 + i % 3 * imgall[i].width);
canvas.settop(imgall[i], 50 + i / 3 * imgall[i].height);
}
else
if (i < 18)
{
canvas.setleft(imgall[i], 300 + (i - 9) % 3 * imgall[i].width);
canvas.settop(imgall[i], 230 + (i - 9) / 3 * imgall[i].height);
}
else
if (i < 27)
{
canvas.setleft(imgall[i], 480 + (i - 18) % 3 * imgall[i].width);
canvas.settop(imgall[i], 230 + (i - 18) / 3 * imgall[i].height);
}
else
if (i < 36)
{
canvas.setleft(imgall[i], 660 + (i - 27) % 3 * imgall[i].width);
canvas.settop(imgall[i], 230 + (i - 27) / 3 * imgall[i].height);
}
else
{
canvas.setleft(imgall[i], 480 + (i - 36) % 3 * imgall[i].width);
canvas.settop(imgall[i], 410 + (i - 36) / 3 * imgall[i].height);
}
}
for (int i = 0; i < 12; i++)
{
button btn = new button();
if (i < 3 || i > 8)
{
btn.width = 50;
btn.height = 30;
if (i < 3)
{
btn.content = "上";
canvas.setleft(btn, 480 + i * btn.width);
canvas.settop(btn, 200);
}
else
{
btn.content = "下";
canvas.setleft(btn, 480 + (i - 9) * btn.width);
canvas.settop(btn, 380);
}
}
else
{
btn.width = 30;
btn.height = 50;
if (i > 2 && i < 6)
{
btn.content = "左";
canvas.setleft(btn, 450);
canvas.settop(btn, 230 + (i - 3) * btn.height);
}
else
{
btn.content = "右";
canvas.setleft(btn, 630);
canvas.settop(btn, 230 + (i - 6) * btn.height);
}
}
btn.tag = i;
btn.click += new routedeventhandler(btn_click);
back.children.add(btn);
}
}
void btn_click(object sender, routedeventargs e)
{
imgmmove.clear();
button btn = (button)sender;
switch (btn.tag.tostring())
{
case "0":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist1)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "1":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist2)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "2":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist3)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "3":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl1)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "4":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl2)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "5":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl3)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
move();
break;
case "6":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl1)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
case "7":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl2)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
case "8":
foreach (image img in imgall)
{
if (cw[(int)img.tag].isl3)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
case "9":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist1)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
case "10":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist2)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
case "11":
foreach (image img in imgall)
{
if (cw[(int)img.tag].ist3)
{
imgmmove.add(img);
}
}
//messagebox.show(imgmmove.count.tostring());
imgmmove.reverse();
move();
break;
}
bool issucess = true;
for (int i = 18; i < 26; i++)
{
if(cw[i].num!=cw[i+1].num)
{
issucess = false;
break;
}
}
if(issucess==true)
{
messagebox.show("成功");
}
}
private void move()
{
image imgtemp = new image();
imgtemp.source = imgmmove[0].source;
int temp=cw[(int)imgmmove[0].tag].num;
for (int i = 0; i < 8; i++)
{
imgmmove[i].source = imgmmove[i + 1].source;
cw[(int)imgmmove[i].tag].num = cw[(int)imgmmove[i+1].tag].num;
}
imgmmove[8].source = imgtemp.source;
cw[(int)imgmmove[8].tag].num = temp;
}
}
}
|
下载地址：
魔方小游戏
希望大家会喜欢。
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：http://blog.csdn.net/mq_shouhug753951mq/article/details/46831177