moves the top n-1 discs from the starting pillar onto the open pillarДў. Which is fine, it's just moving one block at a time instead of moving them in chunks.ДЄnd the function is doing this recursively:ДЎ. 'move the n-2 block (block 1) from pillar 3 (step 1) to pillar 2' 'move the n-1 block (block 2) to pillar 2' 'move the top n-2 block (for 3 blocks, this is block 1) to pillar 3' I understand how recursion works, but I don't understand how and why this algorithm does what it does.ДЎ 2 3= -> => = | | | | | | 1 | 1 | | 1 | | | 2 3 | 2 | | 2 | 3 | | 3ДЄnd I understand that (well, its easy to follow because everything is being moved in 'chunks'). I'm really close to just pulling out a pad of paper and writing down each and every function call and the values involved, but I'm hoping someone who already understands how this works can help me out a bit. So, after each time the second hanoi function is called, it goes through the first few steps again.ДЄt this point, short of writing out /every/ step on a few sheets of paper, I don't see how it actually moves the correct pieces in the correct order. Which starts the entire thing again because the if statement is true. This time, the openPole and startPole values are swapped, so the call should look like this:ДЄt this point, what is the value of n that is passed into the function? At step 2, n = 2, so I'm assuming that the ? in step 4 should be 2-1, or just 1. After the third call's if statement fails, it returns back to step 2, where the first message is printed and Hanoi is called again. (0, 1, 2, 3 ) // if statement fails, function returns back to step 2ДЄnd this is where I'm getting lost. After the next call the function will start returning because the if statement will be false, and then cout will be called for the results of the second recursion (where n = 1). The if statement gets checked again, and now numberOfBlocks = 2, so Hanoi is called again with numberOfBlocks - 1, and the if statement gets checked again seeing that numberOfBlocks now equals 1. In the function, the if statement checks if numberOfBlocks is > 0, which it is, and then calls Hanoi again with numberOfBlocks - 1. Pseudo Code: (n = total blocks, s = start pole, d = dest pole, o = open pole)Д®xample with calling Hanoi( 3, 1, 3, 2) prints out:ДЈ5 minutes later, I'm still trying to figure out why the tower of hanoi recursive algorithm works. I figured that one out pretty quickly, and thought that the next problem couldn't be any harder than that.

The first problem the author wants you to figure out is solving x to the nth power recursively. Alright, so everything was going smooth with this book I'm reading (Data Structures for Game Programmers) until I got to the chapter on recursion.

Hanoi towers discord