mChess->row=mChess->parentChess->row;
 return(tempPList);                               //返回找到的目标棋局
{
   if((!EqualStack(mChess->chess,OpenChessStack))&&(!EqualStack(mChess->chess,CloseChessStack)))
  {
 if(InitChess[x][y]!=0)                          //判断是否x,y宏定义有错
 if(pStack->botton==NULL)
 {
   CreateChess(mChess->chess,tempPList->chess);
}

                                         //判断状态链表中是否有相同的棋局
                return(0);
   ChessList *mChess=new ChessList;       //创建新元素
  {
    FreeListSpace();

void UpMove(int chess[RANK][RANK],int &row,int &column)      //空格上移
   ChessList *mChess=new ChessList;       //创建新元素
 printf("找到了目标棋局/n");
   mChess->parentChess=tempPList;
    mChess->priority=mChess->depth+different;
 }

};

  cout<<"按错键！"<<endl;

};

    Insert(mChess,OpenChessList);             //没有相同的棋局