ACM训练时收集论文之搜索方法中的剪枝优化讨论了竞赛搜索类的常用优化技巧-剪枝-ACM training search the collection of papers on the optimization methods discussed pruning contest category search optimization techniques used- pruning

这道题的算法思路比较简单，其重点在于对搜索的剪枝优化，由于如果对于每一行都枚举每一列，显然其中会有很多在枚举过程中就可以判断不可能出解的情况，显然对这些情况的继续向下一行搜索是无用的冗余操作，所以我们应在枚举搜索中加入一些判断条件，以减少无用的搜索分支。 -Algorithm of solving the problem is relatively simple idea, with its emphasis on the search pruning technique, because

一种改进的aprior算法，用二进制的编码计算来取代传统算法的剪枝和联接操作，可以避免多次扫描系统和减少候选集，提高运算效率-An improved aprior algorithm, using binary coding calculations to replace traditional methods of pruning and join operations, to avoid repeated scanning system and reduce the candidate se

一些人工智能方面的学习源码，用java写的。包括遗传算法 alpha-beta剪枝 模拟退火算法 九宫格 传教士与野人等问题或者算法实现源码。-Some artificial intelligence to learn the source code, written in java. Including genetic algorithm alpha-beta pruning simulated annealing algorithm and other missionaries and Sa