XOR+problem 技术资料

所谓八皇后问题（Eight Queens Problem），是在8*8格的棋盘上，放置8个皇后。要求每行每列放一个皇后,而且每一条对角线和每一条反对角线上最多只能有一个皇后，这是一个典型并行算法，C语言实现。

Proff of the NP-Completeness of the 3-SAT problem

Solving the TSP problem using the Branch and Bound Algorithm

Traveeling sales man problem solved using genetic algorithm in matlab

Genetic Algorithm (GA) based solver for the Traveling Salesman Problem

A demo for Knight s Tour problem by Java applet

this modified PSO algorithm can solve for constrained optimization problem

The decision of a boundary problem a method of Galerkin

IMPLEMENTATION OF DYNAMIC PROGRAMMING ALGORITHMS FOR EDITDISTANCE PROBLEM IN C

This is an example of solving 8puzzle problem by computer