poj1753和2965题（棋盘上的棋子翻转最后达到同一状态）

想想还是得多刷点题。有两道类似的题，都用了深搜和枚举，分别是POJ上的1753题和2965题，先粘贴如下，这个代码是参考别人的代码。思路很清晰，借鉴过来。
Flip Game（1753题）
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 21024 Accepted: 9108
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 theword”Impossible” (without quotes).
Sample Input
bwwb
bbwb
bwwb
bwww
Sample Output
4
这个题目的意思是：有一个四乘四的棋盘，每个棋子有两种状态，非黑即白，翻转一个棋子，它自身以及它上下左右的棋子都会发生翻转，问最少翻转几次（在可能的情况下），使得棋盘上的颜色统一。代码和注释如下。

#include<stdio.h>//1753棋盘翻转
#include<iostream>
using