人工智能的经典八皇后问题,这个算法是a*算法.利用这个算法可以解决八数码,八皇后问题等...

kmeans分类的小程序，聚类算法，大家都来看看吧，-kmeans classification of small procedures, clustering algorithm, as we all look at and see,

人工智能的一种典型的启发式搜索算法，是一种最好优先的算法，但要加上一些约束条件。-A typical artificial intelligence heuristic search algorithm, is a priority of the best algorithm, but to add some more restrictive conditions.

改进遗传算法程序-improved genetic algorithm program

这是我自己花了很多时间写的一个BP神经网络类，里面封装了网络初始化、训练、分类等功能。奉献出来与感兴趣的朋友分享，绝对可靠。-that I spent a lot of time writing in a category BP neural network inside the network initialization package, training, classification capabilities. Dedication out with friends interested in sharing, absolutely reliable.

一个求函数极值的遗传算法程序-function for a maximum of Genetic Algorithm

一遗传算法的例子源程序-Example of a genetic algorithm source code

Hopfield Model神经网络-Hopfield neural network

ai 代码的C++实现，在VC6.0下运行通过-ai code of C++ to achieve，vc++ Running through

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

很好用的统计模式识别工具箱，用matlab编写，enjoy！-good use of statistical pattern recognition toolkit, prepared using Matlab, enjoy!