本文介绍了一种在4x4棋盘上进行的翻转游戏，目标是通过每次翻转3到5个相邻棋子，将所有棋子变为同一颜色。文章提供了一个示例位置，并说明了如何计算达到目标所需的最少翻转轮数。如果初始位置已经达成目标，则输出0，若无法达成目标则输出"Impossible"。
---------------以下是个人感受-------------
其实这道题是放在广搜的单元里，但是无论如何我都觉得用“熄灯问题”的解法更快更省内存。
---------------以下是题目----------
描述
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).
最低0.47元/天 解锁文章
扫一扫
850
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
