Hi, everyone! Recently the user @jaaakee made a really fun topic about printing "Hello World!" in several different languages and I was amazed by it! It was so cool to see all the different kinds of ways to print such simple statement. Some languages, like Python, were quite simple but others, like Assemly (MIPS), weren't that much but both were truly great! I think learning another language, even if not much, it's something incredible! Understanding things you once looked at them and said "How …

This is a bit different. Here you can request challenges. You just include the language you want it in and the difficulty.For instance:

Ey, mate. Can you give me a challenge in python. I'm a beginner, so not too hard please?

The 100th Fibonacci number is already 218922995834555169026, which is not a problem in Python, but would be in other languages.

I would personally take an iterative approach. You could do a recursive approach, but if you don't do it with memoization I don't think you're gonna get higher than 30 for n or something like that. With the memoization, they should be kinda the same, but in practice, the iterative approach will still be faster, because of the overhead of adding something in the call stack.

Note that the returned object is a tuple of tuples. Each of the internal tuples is an ordered pair that specifies a move. The first item in the pair is the peg from which a disk should be taken, and the second item is the peg where the disk should go.

We'll allow you the amount of time it takes to play the game with 64 disks by hand to solve the puzzle.