For Tower of Hanoi, find the formula for the minimum number of moves for n discs. 2/5/2014 | Daniel from Ocala, FL | 1 Answer | 0 Votes Mark favorite Subscribe Comment
This problem is solved here: http://www.cut-the-knot.org/recurrence/hanoi.shtml. No need to duplicate the solution. 2/6/2014 | Kenneth G. Comment