Flip Game -- POJ -- 1753

Flip Game

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: 

1. Choose any one of the 16 pieces. 
2. 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

题意：这是一个棋盘，有一种黑白两面的特殊的棋子，在棋盘中翻动一个棋子，连带着这个棋子的四个方向都需要变动，问使全盘变为同一种颜色而翻动的棋子个数最少，输出翻动的子个数，如果不能使全盘变为同一种颜色，则输Impossible。

思路：数据范围只有4X4的正方形，直接可暴搜即可。把每个棋子，翻与不翻两种情况都搜一遍，每翻一次，都需判断一下是否为同一个颜色。 每一个棋子两种情况，共有2^16种情况。

#include<stdio.h>
int min(int a,int b)
{
    return a<b?a:b;
}
char map[20][20];
int dis[4][2]= {0,1,1,0,-1,0,0,-1},min1;
//判断是否为同一个颜色
int F()
{
    for(int i=0; i<4; i++)
        for(int j=0; j<4; j++)
            if(map[i][j]!=map[0][0])
                return 0;
    return 1;
}
//翻坐标为（x,y）的这个棋子
void turn(int x,int y)
{
    if(map[x][y]=='w')
        map[x][y]='b';
    else map[x][y]='w';
    for(int i=0; i<4; i++)
    {
        int tx=x+dis[i][0];
        int ty=y+dis[i][1];
        if(tx<0||ty<0||tx>=4||ty>=4)
            continue;
        if(map[tx][ty]!='w')
            map[tx][ty]='w';
        else map[tx][ty]='b';
    }
}
void dfs(int x,int y,int step)
{
    if(step>min1)
        return ;
	//符合题意，得出最小的步数
    if(F())
    {
        min1=min(min1,step);
        return ;
    }
    //x表示横坐标，范围[0，3]，x=4表示已经把所有的棋子走过一遍
    if(x==4)
        return ;
	//翻这个棋子
    turn(x,y);
    //y~[0，3]，y>=3表示一行已经走完，须走下一行的第一个数x+1,y=0
    if(y>=3)
        dfs(x+1,0,step+1);
    else dfs(x,y+1,step+1);
	//上面已经翻过这个棋子，再翻一次，和最初一样，表示不翻这个棋子
    turn(x,y);
    if(y>=3)
        dfs(x+1,0,step);
    else dfs(x,y+1,step);
}
int main()
{
    for(int i=0; i<4; i++)
        scanf("%s",map[i]);
    min1=999999;
    dfs(0,0,0);
    if(min1>16)
        printf("Impossible\n");
    else printf("%d\n",min1);
    return 0;
}