对于拼图问题的基于java的A*算法实现。状态空间图中的节点用一个Node对象表示，图中出现的节点（包括已扩展的和未扩展的）存放在一个list（ArrayList的一个对象）中，A*算法运行完毕后，最优路径上的节点存放在pathArray(ArrayList的一个对象)中。程序维护两个变量head和tail，在list中两者之间的节点表示open表中的未扩展节点，list中head之前的属于closed表中的已扩展节点。-Puzzle java-based A* algorithm. State

Binary Search Tree: This project practices the searching algorithm: Binary Search Tree. In this work, two java projects were created, one use the unbounded queue to contain the tree traverse sequence, and another one, for simplicity, use ArrayList.

MC问题（AI）的解答，用JAVA实现。野人与传教士问题。（ArrayList）-The solution to MC problem which is so typical in AI field ,when it comes to the expression of knowledge.Use Java.ArrayList