旋转方块谜题解法（Riddle solving）.doc

旋转方块谜题解法（Riddle solving） The first and second puzzles are solved by myself, without reference to other literatures. The third is the collation of other documents. The first kind of box puzzle is to break a graph into many small squares, and then break the order so that the player returns the picture to its original state. The method of operation is to rotate each of the four adjacent squares clockwise, i.e., the four squares arranged in the upper field, the upper left corner to the upper right corner, the upper right corner to the lower right corner, and the lower right corner to the lower left corner....... This puzzle is different from the puzzle of removing one box after another, and there is no solution. I found a solution that could solve any sort of arrangement. To simplify the problem, consider only the case of a 3*3 grid, and consider how to swap any two squares. For example, the nine squares are arranged as follows: 123 456 798. As long as we can find a way to change the 9 and 8 of the bottom right, the concrete solution is: the left lower three times (the lower left of the four box: 4,5,7,9, clockwise rotation 3 times) Three - left - right next - right next - right on time. For the replacement of the lower left corner of the two box (7 and 9) solution: right next time left on a - - (a - left right next time (*4) in brackets operation was repeated 4 times), 3 times on the left. The two solutions guarantee that the positions of the two adjacent squares can be exchanged without affecting the position of any other square. Just by alternately using and selecting actions based on the actual operation, you can move all the boxes one by one to the appropriate location. In fact, it doesnt need to be so troublesome. Most boxes can be quickly placed in place. Only the last few squares need this solution. Incidentally, the second solution is not required, as long as the first operation can be completed replacement of symmetrical lower left corner of the operati