题目
题解
迭代深搜
注意黑白双方交替走棋(TAT...)
代码
#include <bits/stdc++.h>
using namespace std;
const int fx[5] = {1, -1, 0, 0};
const int fy[5] = {0, 0, -1, 1};
const char turn[2] = {'W', 'B'};
char mp[5][5];
bool suc;
bool check(int x, int y)
{
bool f = true;
for(int i = 1; i <= 4; i++) if(mp[x][i] != mp[x][y]) f = false;//列
if(f) return true;
f = true;
for(int i = 1; i <= 4; i++) if(mp[i][y] != mp[x][y]) f = false;//行
if(f) return true;
if(x == y)
{
f = true;
for(int i = 1; i <= 4; i++) if(mp[i][i] != mp[x][y]) f = false;//对角线'\'
if(f) return true;
}
if(x + y == 5)
{
f = true;
for(int i = 1; i <= 4; i++) if(mp[i][5 - i] != mp[x][y]) f = false;//对角线'/'
if(f) return true;
}
return false;
}
void dfs(int last, int now)//剩余移动次数,该谁走
{
if(!last) return;
for(int i = 1; i <= 4; i++)
for(int j = 1; j <= 4; j++)
if(mp[i][j] == 'O')
for(int k = 0; k <4; k++)
{
int x = i + fx[k], y = j + fy[k];
if(!x || x > 4 || !y || y > 4) continue;
if(mp[x][y] != turn[now]) continue;
swap(mp[i][j], mp[x][y]);//移动
if(check(i, j)) {suc = true; return;}//达到目标则返回
dfs(last - 1, now ^ 1);//继续递归
swap(mp[i][j], mp[x][y]);//还原修改
}
}
int main()
{
for(int i = 1; i <= 4; i++)
{
char s[10]; scanf("%s", s);
for(int j = 1; j <= 4; j++) mp[i][j] = s[j - 1];
}
int d = 0;
while(!suc)
{
d++;
dfs(d, 0); dfs(d, 1);
}
cout << d;
return 0;
}