魔方问题是算法设计中一个难点，搜索算法的复杂度很高，在这个例子中将采用并行处理的算法对其中的限界剪枝算法进行搜索。-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 sear

使用层先算法还原魔方，已有初始状态 如想还原自己的魔方，必须把魔方状态加到源代码中。最后程序给出还原步，是用魔方通用语言表示的-first-use reduction algorithm Cube has initial state who wish to reinstate their Cube, Cube state must be added to the source code. Final procedure is reduced further, the Cube is the

印出n*n的魔方陣 H.Coxeter演算法-show n*n magic square

简单有趣的算法——魔方阵,简单有趣的算法——魔方阵-简单有趣的算法——魔方阵