用广度搜索编的汉诺塔问题，能解决14个盘子的，用到位运算压缩判重，用哈希表判重。The Tower of Hanoi with the breadth of search code problem, can solve the 14 dishes, with a compression sub-re-place operations, using the hash table sub-weight. (2010-04-22, Pascal, 1KB, 下载2次)