说明：  魔方问题是算法设计中一个难点，搜索算法的复杂度很高，在这个例子中将采用并行处理的算法对其中的限界剪枝算法进行搜索。
(algorithm for solving the problem is a difficult design, search algorithm is highly complex, In this example will use parallel processing algorithms which limits pruning algorithm for the search.)