An algorithm of moving pieces to become black alternation with white based on dimension reduction

Abstract

Abstract Moving pieces to become black alternation with white (MPBBAW)is a game in which black and white pieces are continuously arranged by moving. This article traces the problem of MPBBAW and points out the possibility and necessity of computer calculation and commercial application of the problem. Using the non- recursive algorithm based on dimensionality reduction, this article deals with the problem of n-order MPBBAW. The special-order problem is solved and resubstituted. Thus, the computer processing and rule exploration of n-order and n-order MPBBAW are realised. As an auxiliary card, C++ is used to provide 20 black and 20 white pieces as an example. This article lays a foundation for the computer calculation and commercial application of MPBBAW.