Color-changing problem of chess stones
Dou Ji · 2000
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.