十二硬币问题的进一步求解

文章在用AO*算法求解一个智力难题———十二硬币问题的基础上,进一步就如何提高算法效率,如:降低内存消耗、提高计算速度、减少节点生成、防止重复搜索等方面做了一些努力,并把该问题推广到十二个硬币以上的情况,计算出较理想的结果。通过对计算结果的分析,找出了该问题的一般规律,并对结论给出了证明。

The Further Solution of Twelve Coins Problem

After using AOalgorithm to solve the twelve coins problem and get all the solution of this problem,this paper takes further effort to enhance the efficient of the algorithm.For example,try to reduce the memory consume ,speed up the computing,lessen the generating of the nodes,prevent the repeat search etc.Then generalize the problem into more than twelve coins and compute an ideal result.By analysis the results,It finds the general law of the problem and then proves the law.