//this?is?main.cpp
//?九宮格?數(shù)字移動就是?將一個九個格子中初始填充1～8?然后經(jīng)過移動?使之變成目標狀態(tài)
/*
?????初始狀態(tài)??????????1?2?3?????????????1?2?3?
	???????????????????4???5??????->?????4?5?6?
				???????7?8?6?????????????7?8?

*/
//~

//#include“data.h“
#include“search.h“

void?main（）
{
	cout?<????cout?<????cout?<????cout?<????cout?<????cout?<????cout?<?????4?5?6??“?<????cout?<	cout?<
	initial（head）;
	int?i?j;
	for（i?=?0;?i?		for（j?=?0;?j?		{
			cout?<			cin?>>?head.grid[i][j];
		}????
	findzore（head）;
????findweight（head）;

	pnode?p?=?&head;	
	pnode?r?=?search（p）;

	if（?r?!=?NULL）
????{
		cout?<????????output（r）;
????}
}