棋子的颜色变化问题

Color-changing problem of chess stones

讨论了黑白两种颜色的 k(k≥ 3)枚棋子的颜色变化问题。证明了 k =2 n(n=2 ,3,… )枚棋子最多经过 k次变换 T呈全黑 ,同时得出其他一些重要结论。

Color changing problem of two colors of black and white on k(k ≥3) chess stones was discussed. It is proved that all forms of k =2 n ( n =2,3,…) chess stones can be turned wholly black under no more than k times transformation T. Other important conclusions are also obtained.