在一个5×5的棋盘上有12个白色的骑士和12个黑色的骑士, 且有一个空位。在任何时候一个骑士都能按照骑
士的走法(它可以走到和它横坐标相差为1,纵坐标相差为2或者横坐标相差为2,纵坐标相差为1的格子)移动到空
位上。 给定一个初始的棋盘,怎样才能经过移动变成如下目标棋盘: 为了体现出骑士精神,他们必须以最少的步
数完成任务。
Input
第一行有一个正整数T(T<=10),表示一共有N组数据。接下来有T个5×5的矩阵,0表示白色骑士,1表示黑色骑
士,*表示空位。两组数据之间没有空行。
Output
对于每组数据都输出一行。如果能在15步以内(包括15步)到达目标状态,则输出步数,否则输出-1。
Sample Input
2
10110
0111
10111
01001
00000
01011
1101
01110
01010
00100
Sample Output
7
-1
对于当前的某种状态,我们进行估价,
如果不满足,直接退出;
类似A* 搜索?
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
#include<cctype>
//#pragma GCC optimize("O3")
using namespace std;
#define maxn 1000005
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const int mod = 10000007;
#define Mod 20100403
#define sq(x) (x)*(x)
#define eps 1e-10
const int N = 1505;
inline int rd() {
int x = 0;
char c = getchar();
bool f = false;
while (!isdigit(c)) {
if (c == '-') f = true;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
return f ? -x : x;
}
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a%b);
}
ll sqr(ll x) { return x * x; }
int res[6][6] = {
{0,0,0,0,0,0},
{0,1,1,1,1,1},
{0,0,1,1,1,1},
{0,0,0,2,1,1},
{0,0,0,0,0,1},
{0,0,0,0,0,0}
};
int dx[] = { 1,1,2,2,-1,-1,-2,-2 };
int dy[] = { 2,-2,1,-1,2,-2,1,-1 };
int k;
int a[10][10];
int fg;
bool check() {
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= 5; j++) {
if (a[i][j] != res[i][j])return false;
}
}
return true;
}
bool evaluate(int stp) {
int cnt = 0;
for (int i = 1; i <= 5; i++) {
for (int j = 1; j <= 5; j++) {
if (a[i][j] != res[i][j]) {
cnt++;
if (cnt + stp > k)return false;
}
}
}
return true;
}
void dfs(int x, int y, int stp) {
if (stp == k) {
if (check())fg = 1; return;
}
if (fg)return;
for (int i = 0; i < 8; i++) {
int curx = x + dx[i], cury = y + dy[i];
if (curx < 1 || curx>5 || cury < 1 || cury>5)continue;
swap(a[curx][cury], a[x][y]);
if (evaluate(stp) && fg == 0)dfs(curx, cury, stp + 1);
swap(a[curx][cury], a[x][y]);
}
}
int main()
{
//ios::sync_with_stdio(false);
int n;
rdint(n);
while (n--) {
int pox, poy; fg = 0;
for (int i = 1; i <= 5; i++) {
string s; cin >> s;
for (int j = 0; j < 5; j++) {
if (s[j] == '*')a[i][j + 1] = 2, pox = i, poy = j+1;
else a[i][j + 1] = s[j] - '0';
}
}
for (k = 1; k <= 15; k++) {
dfs(pox, poy, 0);
if (fg) {
cout << k << endl; break;
}
}
if (!fg)cout << -1 << endl;
}
}