algorithm - 如何以有效的方式解决魔方

Question

可能重复：
以编程方式求解魔方

我想创建一个应用程序来解决魔方。我读到计算机最多可以在 20 步内解决它。但是在互联网上搜索我找不到如何实现它。所以我想到了 Fridrich 方法（http://en.wikipedia.org/wiki/Fridrich_Method）。但是很难把所有的算法都教给电脑。有什么建议么？ps对不起我的英语:)

Answer 1

The proof that any position can be solved in 20 moves required 35 CPU-years to compute.

It was, however, a constructive proof: for each position (modulo symmetry) it computed an actual solution of 20 moves or less (though not necessarily the optimal solution for that position).

The source code they used to do this is available. It's written in C but using literate programming through CWeb, so it's fairly self-documenting.

Answer 2

您可以使用Korf 算法