论文部分内容阅读
本文由两部分组成:前部分讨论具有4个数据库不等长字在数据库中最优移动方案的理论问题;后部分给出第二类广义Hano Puzzle的一个系统实现方法.
This dissertation consists of two parts: the first part discusses the theoretical problem of the optimal move scheme of 4 databases with unequal length in the database; and the second part gives a system implementation method of the second kind of generalized Hano Puzzle.