POJ1753——Flip Game

Flip Game

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

题目大意：

　　　　一个四乘四的棋盘，上面填满了白或黑子，每次可以选择一个子翻转颜色，翻转的同时其上下左右也同时翻转，输出最少次数，使棋盘所有颜色相同。（考虑不可能的情况）

大体思路：

　　　　有16个格子，每个格子有黑白两种状态。所以可以用一串二进制来表示状态。

　　　　转换成十进制的后，每种状态都可表示为范围为0-65535的唯一整数。

　　　　用bfs来进行搜索，第一次出现0或65535（全白或全黑）就停止搜索，返回dis。

　　　　使用位运算异或来翻转棋子，0^1=1,1^1=0

 #include<stdio.h>
 int vis[]= {},dis[];//0-65535 vis为标记是否已经加入队列 dis表示结点所在层数
 int c=,queue[*];//c用来存最终次数，queue为bfs的队列
 int fz(int a,int xy)//通过位运算来翻转棋盘 xy表示翻转的中间子
 {
     int tmp[]= {,,,,},i;
     tmp[]=tmp[]<<(xy-);
     if (xy==||xy==||xy==||xy==) tmp[]=;
     else tmp[]=tmp[]<<(xy-);
     if (xy==||xy==||xy==||xy==) tmp[]=;
     else tmp[]=tmp[]<<(xy);
     if (xy==||xy==||xy==||xy==) tmp[]=;
     else tmp[]=tmp[]<<(xy-);
     if (xy==||xy==||xy==||xy==) tmp[]=;
     else tmp[]=tmp[]<<(xy+);
     for (i=; i<=; i++)
         a=a^tmp[i];
     return a;
 }
 int bfs(int a)
 {
     int i,t,front=,rear=,tmp=,ok;
     dis[a]=,vis[a]=;
     queue[front]=a;
     while (front<rear)
     {
         for (i=; i<=; i++)
         {
             tmp=fz(queue[front],i);
             if (vis[tmp]==)
             {
                 queue[rear]=tmp;
                 vis[tmp]=;
                 dis[rear++]=dis[front]+;
                 if (tmp==||tmp==)
                 {
                     c=dis[front]+;//找到结果 将步数存入c
                     return ;
                 }
             }
         }
         front++;
     }
     return ;//队列搜素完毕后 仍未找到 则impossible
 }
 int main()
 {
     char tmp[];
     int k,a,i,t=;
     for (i=; i<=; i++)
     {
         scanf("%c",&tmp[i]);
         if (i%==&&i!=) getchar();
     }
     k=,a=;
     for (i=; i>=; i--)//处理输入，转换成整数
     {
         if (tmp[i]=='b') a+=k;
         k*=;
     }
     if (a==||a==)//判断初始状态是否为完成态
     {
         printf("0\n");
         return ;
     }
     t=bfs(a);
     if (t==) printf("Impossible\n",c);
     else printf("%d\n",c);
     return ;
 }