TowerofHanoi is a typical problem that can only be solved using recursive method.
汉诺塔问题是典型的只有用递归方法才能解决的问题。
2
TowerofHanoi problem: There are three pillars ABC, A column has n different sizes of plates, the broader market in the next, small cap on.
汉诺塔问题： 有ABC三根柱子，A柱上有n个大小不等的盘子，大盘在下，小盘在上。
3
Solution time on the TowerofHanoi task correlated highly with two centre executive tasks and three spatial spans, but not with the verbal working memory span.