#Move method hanoi towers how to
#Move method hanoi towers code

The base case ( T 1 = 1) is satisfied because there is no way to solve the game without moving any disks.

We will now show by induction that our algorithm uses the least number of moves. Image 2: After taking 1 step to move the k th disk onto Pole C, all that is left to do is move the k -1 disks onto Pole C. You can play the game Towers of Hanoi right here! This applet will help you understand how the game works. Given that this is about 58.5 times the life span of the Sun, the legend probably overestimates the amount of time we have until the world ends (unless we can survive without the Sun and the Earth). If they were to move one disk per second, then they would need 18,446,744,073,709,551,615 seconds, or 584.54 billion years, to complete the game. We can see the effects of this exponential relationship in the legend about the priests, who had to move 64 disks from one pole to the other. As it turns out, this relationship is exponential (see A More Mathematical Section for details). To fully understand the game's legend, one must understand the relationship between the number of disks and the number of moves. The game is solvable and has a shortest solution (fewest moves) for any number of disks. Each disk must be placed on a larger disk.Each move consists of moving the top disk of one pole onto the top of another pole.Only one disk may be moved at one time.Goal: Move all k disks from the starting pole (typically the leftmost) to the specified end pole (typically the rightmost), following these rules: You can calculate a 'perfect score' using 2 n - 1, where n is the number of discs.The standard game begins with 3 poles, one of which (the starting pole) has some natural number, k, disks placed around it in increasing size from top to bottom, while the other poles start out empty. I like the way you count moves better than the way I implemented it (i did it as an afterthought).I also made the win condition the condition of my game loop, rather than a break out within the loop, which I think is a little nicer.

#Move method hanoi towers code

I used the printf command in my code to show to game stacks vertically rather than horizontally.I like how clean your code is, but I have noticed that your game crashes if you attempt to move from an empty stack with a nil error.Hash keys does seem like a much better way to solve this: After each move, check to see if they have succeeded in moving all the discs, to the final pile. In a loop, prompt the user (using gets) and ask what pile to select a disc from, and where to put it. Pick a representation of the discs to store in the arrays maybe just a number representing their size. Keep three arrays, which represents the piles of discs. Puts 'a perfect score is ' + (2**numdiscs - 1).to_s Until (stack2 = wincheck) | (stack3 = wincheck)Įlsif movefrom = 1 & moveto = 2 & unt != 0 Puts 'please enter a reasonable number of discs' Puts 'so they are in order with smallest on top' Puts 'The object of this game is to stack all the discs' Here is my own noobie version of Towers: def towersofhanoi You may want to narrate in another language, for example. The narration responsibility arguably does not belong in the game class. I have separated the game logic from the narration logic. Puts 'You win the game! You did it in # moves!' If tower2.length = 0 || tower3.last < tower2.last If tower1.length = 0 || tower3.last < tower1.last If tower3.length = 0 || tower2.last < tower3.last If tower1.length = 0 || tower2.last < tower1.last If tower3.length = 0 || tower1.last < tower3.last You can't place a bigger tile on top of a smaller one.' If tower2.length = 0 || tower1.last < tower2.last Puts 'You can't put the same disc where you got it from!' Puts 'Please select what tower you want to place disc:' Puts 'Please select what tower you want to chose from:' Puts 'Here is how the game board looks right now:' Puts 'How many discs would you like to start with?' It works (I've played it), but I repeat my code A LOT! Is there a better way to write this without all the repeating but still making sense for a beginner? tower1 = This is 3 towers of Hanoi where the user selects where to choose from and where to go with each disc, and not to have a bigger disc on top of a smaller one.

#Move method hanoi towers how to

I am just learning how to code in Ruby now with no prior experience.