Simulated annealing algorithm the document on the simulated annealing algorithm...

非常经典的遗传算法工具包，C语言版本的。包括各种常用算法-very classic genetic algorithm tool kit version of the C language. Including common algorithms

k均值聚类算法源码，比较经典，无解压密码-kmeans clustering algorithm source code,comparatively classical,no password for unzip

人工智能方面一个专家系统的简单例子-artificial intelligence expert system for a simple example

bp反向传播算法，用c语言编写，用于航空运输预测。

关于机器人的手臂程序，包含最基本的移动，-Procedures on the robot arm, including the most basic mobile,

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...

单神经元pid源码实现，对初学的朋友很有帮助-The program can realize single neural pid with MATLAB.The algorithm is simple and easy to understand.

8皇后问题。所谓著名的八皇后问题就是八个皇后在8*8的网格中排列时不能同在一行、一列或者一条斜线上。根据前人的研究，在8！=40320种排列中只有92中解决方案。-8 Queen

用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.

用元胞自动机实现单色10000个空间位置的细菌分裂试验的算法C语言代码-Using Cellular Automata 10,000 monochrome realize spatial location of bacteria to split the test algorithm C language code