User talk:Dannylec9

Tower of Hanoi
Welcome to Wikipedia, and thanks for your contribution to the article. You can actually calculate the number of moves required to solve the puzzle as (2^n)-1, without having to do anything recursive - I've removed your section and made the number-of-moves point earlier in the article, since it seems fairly fundamental to the puzzle. Thanks for spotting that it hadn't been explicitly mentioned. --McGeddon (talk) 09:33, 19 May 2010 (UTC)

Well thank you very much for informing me since i hadn´t read the whole article I didn´t notice so ty for giving me the explicit, i actually thoght about making one but I wasn´t on my best last night.