Flip Game

最新推荐文章于 2022-05-23 22:22:19 发布

CambridgeICPC

最新推荐文章于 2022-05-23 22:22:19 发布

阅读量175

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/CambridgeICPC/article/details/81224359

本文介绍了一款名为FlipGame的游戏，该游戏在一个4x4的棋盘上进行，目标是通过翻转选定棋子及其相邻棋子来使所有棋子颜色统一。文章提供了一个程序解决方案，该程序采用深度优先搜索策略来寻找最少的翻转次数。

Flip Game

原题链接 http://poj.org/problem?id=1753

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*4方格，每个方格中各有一颗棋子，有的是白色的，有的是黑色，棋子正反两面的颜色为白色和黑色，在这16颗棋子中选择棋子并翻动它四周的棋子，使得所有的棋子颜色一致，输出最小翻动的次数。

搜索题，从第一颗开始搜索，翻动棋子，更新坐标，每次判断是否颜色一致，并更新最小值输出即可。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;

int sum;
char str[10];
int mapp[10][10];

int check()
{
    int x=mapp[0][0];
    for(int i=0; i<4; i++)
    {
        for(int j=0; j<4; j++)
        {
            if(mapp[i][j]!=x)
            {
                return 0;
            }
        }
    }
    return 1;
}

void search(int x,int y)
{
    mapp[x][y]=!mapp[x][y];
    if(x-1>=0)
        mapp[x-1][y]=!mapp[x-1][y];
    if(x+1<4)
        mapp[x+1][y]=!mapp[x+1][y];
    if(y-1>=0)
        mapp[x][y-1]=!mapp[x][y-1];
    if(y+1<4)
        mapp[x][y+1]=!mapp[x][y+1];
}

int dfs(int x,int y,int t)
{
    if(check())
    {
        if(sum>t)
        {
            sum=t;
            return 0;
        }
    }
    if(x>=4||y>=4)
    {
        return 0;
    }
    int dx=(x+1)%4;
    int dy=y+(x+1)/4;
    dfs(dx,dy,t);
    search(x,y);
    dfs(dx,dy,t+1);
    search(x,y);
    return 0;
}

int main()
{
    for(int i=0; i<4; i++)
    {
        scanf("%s",str);
        for(int j=0; j<4; j++)
        {
            if(str[j]=='b')
            {
                mapp[i][j]=0;
            }
            else
            {
                mapp[i][j]=1;
            }
        }
    }
    sum=inf;
    dfs(0,0,0);
    if(sum==inf)
        printf("Impossible\n");
    else
        printf("%d\n",sum);
    return 0;
}