poj 1753 Flip Game (bfs+bit位运算 ---好题！)

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

Hadis_yuki

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

阅读量3.4k

点赞数 1

分类专栏：搜索文章标签： bfs 模拟翻棋子 bit 位运算

本文链接：https://blog.csdn.net/u011262722/article/details/9736385

版权

博客介绍了如何解决翻棋子的游戏问题，其中涉及使用位运算和模拟操作。题目要求从给定的初始状态通过翻转棋子使其全部变为黑色或白色，如果可以实现，输出翻转步数；否则输出"Impossible"。博主通过位运算简化问题，并利用10进制的后16位模拟棋盘状态。此外，还分享了位运算的运用技巧，如设置和取反位，以及使用数组模拟队列的经验。最后提到该问题也可用迭代加深DFS方法求解。

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

Flip Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 25323		Accepted: 10927

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).