关于连连看随机排列的算法

typedef struct
{
int x1, y1, x2, y2; //点击2个物体的4个坐标
}Pt;


void fun(Pt pt[], int x, int y) //x列数，y行数，pt[]数组存放消除模块的坐标
{
if (x*y % 2 == 1)//如果都是奇数，无解
return;
int i, j, m, n, k = 0, l = x * y / 2;


char **num = new char *[y];


for (i = 0; i < y; ++i) //动态分配空二维间
num[i] = new char[x];


for (i = 0; i < y; ++i)
memset(num[i], 0, sizeof(char)*x); //数据清零


while (true)
{
m = rand() % x; //随机列值
n = rand() % x;


if (m != n)
{
for (i = 0; i < y; ++i) //从第一行起检索第m列的值
if (num[i][m]) //若果为不零则此处已访问
continue;
else
break; //若此处为零说明没访问，结束循环
for (j = 0; j < y; ++j) //从第一行起检索第n列的值
if (num[j][n])
continue;
else
break;
if (i < y && j < y) //如果第m列的第i行的元素，与第n列的第j行的元素 都没访问
{


num[i][m] = 1; //设置该处访问
num[j][n] = 1;
pt[k].x1 = m; //记录坐标
pt[k].y1 = i;
pt[k].x2 = n;
pt[k].y2 = j;
++k;
if (l == k) //如果数组数到行列乘积的一半，结束循环每个数组2个坐标
break;
}
}
m = rand() % x; //从最后一行开始
n = rand() % x;


if (m != n)
{
for (i = 0; i < y; ++i)
if (num[y - 1 - i][m])
continue;
else
break;
for (j = 0; j < y; ++j)
if (num[y - 1 - j][n])
continue;
else
break;
if (i < y && j < y)
{
num[y - 1 - i][m] = 1;
num[y - 1 - j][n] = 1;
pt[k].y1 = y - 1 - i;
pt[k].x1 = m;
pt[k].y2 = y - 1 - j;
pt[k].x2 = n;
++k;
if (l == k)
break;
}
}
m = rand() % y; //从第一列开始
n = rand() % y;


if (m != n)
{
for (i = 0; i < x; ++i)
if (num[m][i])
continue;
else
break;
for (j = 0; j < x; ++j)
if (num[n][j])
continue;
else
break;
if (i < x && j < x)
{
num[m][i] = 1;
num[n][j] = 1;
pt[k].x1 = i;
pt[k].y1 = m;
pt[k].x2 = j;
pt[k].y2 = n;
++k;
if (l == k)
break;
}
}
m = rand() % y; //从最后一列开始
n = rand() % y;


if (m != n)
{
for (i = 0; i < x; ++i)
if (num[m][x - 1 - i])
continue;
else
break;
for (j = 0; j < x; ++j)
if (num[n][x - 1 - j])
continue;
else
break;
if (i < x && j < x)
{
num[m][x - 1 - i] = 1;
num[n][x - 1 - j] = 1;
pt[k].x1 = x - 1 - i;
pt[k].y1 = m;
pt[k].x2 = x - 1 - j;
pt[k].y2 = n;
++k;
if (l == k)
break;
}
}
}
for (i = 0; i < y; ++i) //释放申请空间
delete[]num[i];
delete[]num;
}//实测while循环平均值在73次，每次最多得到4组（typedef struct{int x1, y1, x2, y2;}）数据