flash连连看自动寻道算法

作者佚名技术来源服务器技术浏览发布时间 2012-07-13

is) {
p1 = 100;
}
//纵向检测《---
if (first>x) {
dis = first-x-1;
for (z=1; z<=dis; z++) {
q = first-z;
if (zt[q] == 9) {
p2++;
}
}
} else {
dis = x-first-1;
for (z=1; z<=dis; z++) {
q = x-z;
if (zt[q] == 9) {
p2++;
}
}
}
if (p2 == dis) {
p2 = 100;
}
if (second>y) {
dis = second-y-1;
for (z=1; z<=dis; z++) {
q = second-z;
if (zt[q] == 9) {
p3++;
}
}
} else {
dis = y-second-1;
for (z=1; z<=dis; z++) {
q = y-z;
if (zt[q] == 9) {
p3++;
}
}
}
if (p3 == dis) {
p3 = 100;
}
p = p1+p2+p3;
if (p == 300) {
co = math.abs(x-y)/12+math.abs(second-y)+math.abs(first-x);
}
return (co);
}
function jiance_lie2(x, y) {
p4 = 0;
if (x>y) {
dis = (x-y)/12-1;
for (z=1; z<=dis; z++) {
q = x-z*12;
if (zt[q] == 9) {
p4++;
}
}
} else {
dis = (y-x)/12-1;
for (z=1; z<=dis; z++) {
q = y-z*12;
if (zt[q] == 9) {
p4++;
}
}
}
if (p4 == dis) {
p4 = 100;
}
return (p4);
}
function panduan_cuowei() {
g = 1000;
gg = 1000;
br = 0;
j = 0;
k = 0;
line1 = first%12;
line2 = second%12;
line3 = math.floor(first/12);
line4 = math.floor(second/12);
for (i=1; i<=12; i++) {
jilu1[i] = line1+(i-1)*12;
jilu2[i] = line2+(i-1)*12;
//HANG
jilu3[i] = line3*12+i;
jilu4[i] = line4*12+i;
//LIE
}
for (i=1; i<=12; i++) {
if (jilu1[i] == first) {
if (zt[jilu2[i]] == 9) {
w = jiance_cuowei01(jilu2[i]);
if (w == 200) {
guaixian1_hen1(jilu2[i]);
_root.control.ok();
br = 1;
break;
}
}
} else if (jilu2[i] == second) {
if (zt[jilu1[i]] == 9) {
w = jiance_cuowei02(jilu1[i]);
if (w == 200) {
guaixian1_hen2(jilu1[i]);
_root.control.ok();
br = 1;
break;
}
}
}
if (zt[jilu1[i]] == 9 and zt[jilu2[i]] == 9) {
j = jiance_hen1(jilu1[i], jilu2[i]);
}
if (j>0) {
if (j g = j;
g1 = jilu1[i];
g2 = jilu2[i];
}
//_root.control.ok();
} else {
if (zt[jilu3[i]] == 9 and zt[jilu4[i]] == 9) {
k = jiance_lie1(jilu3[i], jilu4[i]);
}
if (k>0) {
if (k gg = k;
g3 = jilu3[i];
g4 = jilu4[i];
}
}
}
}
if (br == 0) {
if (g != 1000) {
guaixian2_hen(g1, g2);
br = 1;
} else if (gg != 1000) {
guaixian2_lie(g3, g4);
}
}
}
function jiance_cuowei01(x) {
//错位状态1;
p1 = 0;
p2 = 0;
dis = math.abs(x-first)-1;
if (dis == 0) {
p1 = 100;
} else {
if (x>first) {
for (z=1; z<=dis; z++) {
q = x-z;
if (zt[q] == 9) {
p1++;
}
}
} else {
for (z=1; z<=dis; z++) {
q = first-z;
if (zt[q] == 9) {
p1++;
}
}
}
if (p1 == dis) {
p1 = 100;
}
}
dis = math.abs((second-x))/12-1;
if (dis == 0) {
p2 == 100;
} else {
if (second>x) {
for (z=1; z<=dis; z++) {
q = second-z*12;
if (zt[q] == 9) {
p2++;
}
}
} else {
dis = math.abs(dis);
for (z=1; z<=dis; z++) {
q = x-z*12;
if (zt[q] == 9) {
p2++;
}
}
}

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务，公司网站：http://www.lingzhong.cn 为了给广大客户了解更多的技术信息，本技术文章收集来源于网络,凌众科技尊重文章作者的版权，如果有涉及你的版权有必要删除你的文章，请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息，谢谢!

分享到：更多

你可能对下面的文章感兴趣

上一篇: 气体升腾,水花飞溅.火的原理下一篇: 飞机游戏（彩京类型《飞天站记》）

关于flash连连看自动寻道算法的所有评论

随机推荐