main.cpp

来自「根据人工智能中双向搜索的方法对8数码的问题进行解决」· C++ 代码 · 共 1,434 行 · 第 1/3 页

CPP
1,434 行
字号
123
				return NULL;
			}
		}
		if(posy==SqureEdge-1)
		{
			if(temp[posx-1][posy]=='0')
			{
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[0]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[1]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL)
					pCurNode->isActive=false;
				return NULL;
			}
			if(temp[posx][posy-1]=='0')
			{
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[0]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[1]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL)
					pCurNode->isActive=false;
				return NULL;
			}
			if(temp[posx+1][posy]=='0')
			{
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[0]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				pChildTemp=new NumNodeInfo;
				InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
				if(isExistedNode(pChildTemp,pSelfTreeRootNode))
					delete pChildTemp;
				else
				{
					pCurNode->pChildNode[1]=pChildTemp;
					if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
						return pChildTemp;
				}
				if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL)
					pCurNode->isActive=false;
				return NULL;
			}
		}
		if(temp[posx-1][posy]=='0')
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL&&pCurNode->pChildNode[2]==NULL)
				pCurNode->isActive=false;
			return NULL;
		}
		if(temp[posx+1][posy]=='0')
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL&&pCurNode->pChildNode[2]==NULL)
				pCurNode->isActive=false;
			return NULL;
		}
		if(temp[posx][posy+1]=='0')
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL&&pCurNode->pChildNode[2]==NULL)
				pCurNode->isActive=false;
			return NULL;
		}
		if(temp[posx][posy-1]=='0')
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			if(pCurNode->pChildNode[0]==NULL&&pCurNode->pChildNode[1]==NULL&&pCurNode->pChildNode[2]==NULL)
				pCurNode->isActive=false;
			return NULL;
		}
	}
	if(pParNode==NULL)
	{
		if (posx==0&&posy==0)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if (posx==0&&posy==SqureEdge-1)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if (posx==SqureEdge-1&&posy==SqureEdge-1)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if (posx==SqureEdge-1&&posy==0)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if(posx==0)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if(posy==0)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if(posx==SqureEdge-1)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy+1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		if(posy==SqureEdge-1)
		{
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[0]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[1]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			pChildTemp=new NumNodeInfo;
			InitNode(posx,posy,posx,posy-1,pCurNode,pChildTemp);
			if(isExistedNode(pChildTemp,pSelfTreeRootNode))
				delete pChildTemp;
			else
			{
				pCurNode->pChildNode[2]=pChildTemp;
				if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
					return pChildTemp;
			}
			return NULL;
		}
		pChildTemp=new NumNodeInfo;
		InitNode(posx,posy,posx+1,posy,pCurNode,pChildTemp);
		if(isExistedNode(pChildTemp,pSelfTreeRootNode))
			delete pChildTemp;
		else
		{
			pCurNode->pChildNode[0]=pChildTemp;
			if(isExistedNode(pChildTemp,pNeighborTreeRootNode))
				return pChildTemp;
		}
		pChildTemp=new NumNodeInfo;
		InitNode(posx,posy,posx-1,posy,pCurNode,pChildTemp);
		if(isExistedNode(pChildTemp,pSelfTreeRootNode))
			delete pChildTemp;
		else
123

main.cpp - 源码说明

本页面展示了「根据人工智能中双向搜索的方法对8数码的问题进行解决」中的 main.cpp 源码文件，采用 C++ 编程语言编写，共 1,434 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与人工智能相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?