摘要或動機

如果n-1 個正四面體在n 個面的多面體棋盤中翻轉(如：正八面體、正二十面體、五邊雙菱錐及三角錐台棋盤)，則正四面體相互之間會受到很多限制。本研究為探討n-1 個正四面體在n 個面的多面體棋盤中，利用其翻轉的特性，翻轉至相鄰空格，進而完成：1. 每個正四面體的底面及側面均能「同色共面」。2. 在滿足以上的兩個條件下做「數字排序」。3. 探討每個遊戲在各階段是否有解的情形。最後，將遊戲推廣至正八面體在多面體棋盤中的翻轉。If n-1 pyramids can turn in the chessboard of n planes pyramids (ex: 8 planes pyramid, 20 planes pyramid, 5 sides bi rhombus pyramid and triangular pyramid chessboard) there are lost of restrictions between these pyramids. This research is discussing about the n-1 pyramids in the chessboard of n planes multi pyramid, which have the peculiarity of turn that can turn to nearby space. We found that: 1. Each pyramid’s button plane and aide plane can be “same plane same color”. 2. Matching about 2 conditions then can do “order by numbers”. 3. Search for answers of each levels in each game. Finally, the game will be propagated to eight planes pyramid can turn on the chessboard of multi pyramid.