[//]: # (推荐题解模板，请替换blablabla等内容 ^
宽搜（暴力出奇迹）
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹
暴力出奇迹v暴力出奇迹
暴力出奇迹
暴力出奇迹暴力出奇迹暴力出奇迹暴力出奇迹暴力出奇迹

暴力出奇迹
暴力出奇迹暴力出奇迹暴力出奇迹
暴力出奇迹
暴力出奇迹

C++ 代码

include[HTML_REMOVED]

using namespace std;
string a;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
char dch[4]={‘d’,’l’,’u’,’r’};
unordered_map[HTML_REMOVED] mp;
struct node{
string st;
string ans;
int times;
};
node t;
string b;
queue[HTML_REMOVED]q;
int main(){
a=”“;
for (int i=1;i<=9;i)
{
cin>>b;
a+=b;
}
int nxs=0;
/*for(int i=0;i[HTML_REMOVED]a[j]) nxs;
}
}
if(nxs%2!=0)
{
cout<<”unsolvable”<[HTML_REMOVED]2||ny<0||ny>2) continue;
nnum=nx*3+ny;
t=nt;
t.st[num]=t.st[nnum];
t.st[nnum]=’x’;
t.ans+=dch[i];
t.times++;
if (mp[t.st]==true) continue;
mp[t.st]=true;
if (t.st==”12345678x”)
{
cout<<t.ans<<endl;
return 0;
}
q.push(t);
}
q.pop();
}
cout<<”unsolvable”<<endl;
return 0;
}
暴力出奇迹