八数码难题用Java语言实现，搜索算法为广度优先-eight-figure-puzzle in Java

由Helsgaun改进的Lin-Kernighan局部启发搜索算法（LKH）求解大规模TSP问题，使用Java语言实现，具有强大的求解TSP性能。-Helsgaun improved the Lin-Kernighan local search algorithm (LKH) for solving large scale TSP problem, use the Java language, solving the TSP with a strong performance.

两个搜索算法的实现，一、顺序搜索；二、二叉搜索（折半搜索），使用java实现-Two search algorithm implemented, a, sequential search Second, binary search (binary search), use Java implementation