//连连看游戏的核心算法BOOL CanConnect(char map[11][19], int row1, int col1, int row2, int col2){int path, i, j, left, right, top, bottom;int min1, min2, max1, max2;//-----------------查找水平方向----------------------------    min1 = max1 = col1;    min2 = max2 = col2;while(min1 - 1 >= 0 && map[row1][min1 - 1] == 0) min1--;while(min2 - 1 >= 0 && map[row2][min2 - 1] == 0) min2--;    left = __max(min1, min2);

while(max1 + 1 < 19 && map[row1][max1 + 1] == 0) max1++;while(max2 + 1 < 19 && map[row2][max2 + 1] == 0) max2++;    right = __min(max1, max2);

//检查两条水平线之间是否有可连通的垂直线     for(i = left; i <= right; i++)    {        path = 0;for(j = __min(row1, row2) + 1; j < __max(row1, row2); j++)        {            path += map[j][i];if(path > 0) break;        }if(path == 0)return TRUE;    }

//-----------------查找垂直方向----------------------------    min1 = max1 = row1;    min2 = max2 = row2;while(min1 - 1 >= 0 && map[min1 - 1][col1] == 0) min1--;while(min2 - 1 >= 0 && map[min2 - 1][col2] == 0) min2--;    top = __max(min1, min2);

while(max1 + 1 < 11 && map[max1 + 1][col1] == 0) max1++;while(max2 + 1 < 11 && map[max2 + 1][col2] == 0) max2++;    bottom = __min(max1, max2);

//检查两条垂直线之间是否有可连通的水平线     for(j = top; j <= bottom; j++)    {        path = 0;for(i = __min(col1, col2) + 1; i < __max(col1, col2); i++)        {            path += map[j][i];if(path > 0) break;        }if(path == 0)return TRUE;    }return FALSE;}

//用于寻找可点击方块的后台线程，进入线程时，map 已经初始化好了DWORD WINAPI MyThread(LPVOID lpParameter){    PMYTHREAD_PARAMS pMyParams = (PMYTHREAD_PARAMS)lpParameter;int i;    HWND hwnd = pMyParams->hWndUI;    PCELLPOS pNode1, pNode2;    BOOL bAllListIsNull;    BOOL bFind_One_Solution; //是否找到了一个解     while( !bThreadStopSignal )    {        bAllListIsNull = TRUE;        bFind_One_Solution = FALSE;

//此处暴力的盲目搜索就是了~。~ 有时间的话需要让此处更“智能化”！//pCellPos[0]就是代表空白位置的链表，永远为 NULL （浪费掉了）         for(i = 1; i < CELL_TYPE_COUNT; i++)        {//在链表中搜索是否可点击类似金刚石画法，时间复杂度：O(n^2)            if(pCellPos[i] != NULL)            {                bAllListIsNull = FALSE; //存在链表不为空                   pNode1 = pCellPos[i];while(pNode1 != NULL)                {                    pNode2 = pNode1->pNext;while(pNode2 != NULL)                    {if(CanConnect(map, pNode1->row, pNode1->col, pNode2->row, pNode2->col))                        {//找到了一对可点击方块                                 map[pNode1->row][pNode1->col] = 0;                            map[pNode2->row][pNode2->col] = 0;

                            CLICKINFO cInfo;                            cInfo.row1 = pNode1->row;                            cInfo.col1 = pNode1->col;                            cInfo.row2 = pNode2->row;                            cInfo.col2 = pNode2->col;                            SendMessage(hwnd, WM_CLICKINFO_FIND, (WPARAM)pMyParams->bIsAutoClick, (LPARAM)(&cInfo));

                            RemoveNodeFromList(&pCellPos[i], pNode1);                            RemoveNodeFromList(&pCellPos[i], pNode2);

                            bFind_One_Solution = TRUE;                        break;                        }

//由于两个Node都已经被释放了，所以必须立即结束对当前链表中的搜索。                            if(bFind_One_Solution)break;

                        pNode2 = pNode2->pNext;                    }

if(bFind_One_Solution)break;                    pNode1 = pNode1->pNext;                }            }        }

//已经没有方块了？         if(bAllListIsNull)        {//发送消息，所有解已经搜索完毕，游戏可以胜利清空所有方块              PostMessage(hwnd, WM_SOLUTION_COMPLETE, 0, 0);break;        }//对所有链表都搜索完毕了，但找不到解，需要重排！         else if(!bFind_One_Solution)        {            PostMessage(hwnd, WM_NEED_RERANGE, 0, 0);break;        }    }    bThreadRunning = FALSE;return 0;}

//释放某一个链表，最后把表头置为NULLvoid FreeList(PCELLPOS* ppHead){    PCELLPOS pTmp = NULL;    PCELLPOS pNode = *ppHead;while(pNode != NULL)    {        pTmp = pNode->pNext;        free(pNode);        pNode = pTmp;    }    (*ppHead) = NULL;}

//把一个新节点挂接到指定链表上，如果链表为空，则会被创建！void AddNodeToList(PCELLPOS* ppHead, int row, int col){    PCELLPOS pNewNode = (PCELLPOS)malloc(sizeof(CELLPOS));    pNewNode->row = row;    pNewNode->col = col;    pNewNode->pForward = NULL;    pNewNode->pNext = NULL;

if(*ppHead == NULL)    {        *ppHead = pNewNode;return;    }else    {//找到tail节点，然后挂接上去！         PCELLPOS pCur = *ppHead;while(pCur->pNext != NULL)            pCur = pCur->pNext;

        pNewNode->pForward = pCur;        pCur->pNext = pNewNode;    }}

//从链表中把指定的节点除去，如果是最后一个节点，则会导致该链表被置为 NULLvoid RemoveNodeFromList(PCELLPOS* ppHead, PCELLPOS pNode){//是表头吗    if(pNode == *ppHead)    {        *ppHead = pNode->pNext;    }

// [Forward] <--> [X] <--> [Next]// [Forward] <-----------> [Next]

if(pNode->pForward != NULL)        pNode->pForward->pNext = pNode->pNext;

if(pNode->pNext != NULL)        pNode->pNext->pForward = pNode->pForward;

    free(pNode);}