Flip Game

FlipGame算法解析

最新推荐文章于 2022-05-22 18:22:12 发布

原创最新推荐文章于 2022-05-22 18:22:12 发布 · 493 阅读

0 ·

CC 4.0 BY-SA版权

poj 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一个名为FlipGame的游戏，该游戏在一个4x4的棋盘上进行，玩家通过翻转黑白棋子来尝试达到所有棋子颜色一致的目标。文章详细解释了游戏规则，并提供了一段C++代码实现，用于寻找达成目标所需的最少轮数。

Flip Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 40791		Accepted: 17715

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

Source

Northeastern Europe 2000

#include<iostream>
#include<cstdio>
using namespace std;
int map[4][4],step,flag = 0;
void turn(int i ,int j)
{
	map[i][j] = !map[i][j];
	if(i > 0)
		map[i-1][j] = !map[i-1][j];
	if(i < 3)
		map[i+1][j] = !map[i+1][j];
	if(j > 0)
		map[i][j-1] = !map[i][j-1];
	if(j < 3)
		map[i][j+1] = !map[i][j+1];
}
int judge()
{
	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;
}
void dfs(int i,int j,int dp)
{
	if(dp  == step)
	{
		flag = judge();
	}
	if(flag || i == 4)
		return ;
	turn(i,j);
	if(j < 3)
		dfs(i,j+1,dp+1);
	else
		dfs(i+1,0,dp+1);
	turn(i,j);
	if(j < 3)
		dfs(i,j+1,dp);
	else
		dfs(i+1,0,dp);
	return ;
}
int main()
{
	char e;
	for(int i = 0;i < 4;i++)
	{
		for(int j = 0;j < 4;j++)
		{
			cin >> e;
			if(e == 'b')
				map[i][j] = 0;
			else
				map[i][j] = 1;
		}
		getchar();
	}
	for(step = 0;step <= 16;step++)
	{
		flag = 0;
		dfs(0,0,0);
		if(flag)
		   break;
	}
	if(flag)
		cout<<step<<endl;
	else
		cout<<"Impossible"<<endl;
	return 0;
}