POJ1753翻转游戏（题目大意+理解）

Flip Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 40249 Accepted: 17477

Description
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it’s black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules:

Choose any one of the 16 pieces.
Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).

Consider the following position as an example:

bwbw
wwww
bbwb
bwwb
Here “b” denotes pieces lying their black side up and “w” denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become:

bwbw
bwww
wwwb
wwwb
The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal.

Input
The input consists of 4 lines with 4 characters “w” or “b” each that denote game field position.

Output
Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it’s impossible to achieve the goal, then write the word “Impossible” (without quotes).

Sample Input

bwwb
bbwb
bwwb
bwww

Sample Output

4
题目大意：将棋子翻转，最后使颜色相同，每次翻转一个，可以反转的次数是0-16，因为4*4矩阵嘛，每一块都有翻转的可能，其实，就反偶数次和奇数次两种可能，比如2和4次结果是一样的，因为3会把原来的翻回去，求最少的翻转次数。

#include<stdio.h>
#include<string.h> 
int step;
char a[6][6];//为了不越界，定为6行6列，实际只需要中间的1-4
bool flag;
int r[]={-1,1,0,0,0};//5个方向
int c[]={0,0,-1,1,0};
bool judge()
{
    for(int i=1;i<5;i++)
    {
        for(int j=1;j<5;j++)
        {
            if(a[i][j]!=a[1][1])//判断不相同
            {
                return false;
            }
        }
    }
    return true;    
}
void flip(int row,int column)
{
    for(int i=0;i<5;i++)
    {
        a[row+r[i]][column+c[i]]=!a[row+r[i]][column+c[i]];//翻转成和原来相反的颜色
    }
    return;
}
void dfs(int row,int column,int deep)//deep是走的步数
{   
    if(deep==step)
    {
        flag=judge();//成功出口，找到全盘都一样的状态了
        return;
    }
    if(flag||row==5) //不满足的失败出口
    {
        return;
    }
    flip(row,column);//翻转
    if(column<4)
        dfs(row,column+1,deep+1);
    else
        dfs(row+1,1,deep+1);
    flip(row,column);//不满足将其重新返回来   
    if(column<4)
        dfs(row,column+1,deep);
    else
        dfs(row+1,1,deep);
    return;
}
int main()
{
    char c; 
    for(int i=1;i<5;i++)
    {
        for(int j=1;j<5;j++)
        {
            c=getchar();//输入字符
            if(c=='b')
            {
                a[i][j]=1;//将黑色全赋为1
            }
        }
        getchar();
    }
    for(step=0;step<=16;step++)//可以翻转的块数
    {
        dfs(1,1,0);//将坐标传过去
        if(flag)
        {
            break;
        }
    }
    if(flag)
    {
        printf("%d\n",step);
    }
    else
    {
        printf("Impossible\n");
    }
    return 0;
 }