POJ 1753 Flip Game

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

Zephyrrrrrrrrr

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

阅读量282

点赞数

分类专栏： ACM DFS 枚举文章标签： poj DFS 枚举

本文链接：https://blog.csdn.net/chedan666/article/details/51769819

版权

这是一篇关于POJ 1753 Flip Game的问题解析，目标是将4x4棋盘上的所有棋子翻转成单一颜色。通过深度优先搜索策略，对所有可能的翻转组合进行枚举，找出达到目标状态所需的最少翻转次数。如果无法达成目标，则输出'Impossible'。

摘要由CSDN通过智能技术生成

原题目网址： http://poj.org/problem?id=1753

题目：
Flip Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 39210 Accepted: 17050
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 t