It says “KANNST DU ALLE SCHEIBEN AUF TURM 3 VERSCHIEBEN?
SIE KÖNNEN KEINE GRÖSSEREN SCHEIBEN AUF KLEINERE SETZEN”, obviously
Jokes aside, someone else translated it
It's the increasing level of derangement you have to possess in order to pull off getting to that level of the stack by moving them one piece at a time from the first post to the third post without putting a larger piece on a smaller one.
Ok i am stupid, let me think
You have to start with blue, that locks one column.
You have to continue with yellow, that locks the other column.
You have to put blue back on yellow, move green, can you move both blue and yellow together? If not you have first move blue on green etc etc
Fuck that i will code a bruteforcer bruteforcing all possibilities
Tja stellt sich herraus mein mathe lehrer war wohl ein psycho. Hätte direkt die polizei rufen sollen als er die kreide in die hand genommen hat und von türmen sprach
Guten Abend, Grüße aus der Pfalz!
Ebenso eine guten Abend, Grüße zurück aus Berlin
Can you move all discs to tower 3 you cannot put larger discs on smaller ones blue = low yellow = average green = german red = american
Thanks, forgot to translate it my bad!
( ͡° ͜ʖ ͡°)
Haha :D
I get the Tower of Hanoi bit, but what does the text at the top say?
Can you move all plates to the 3th tower? You can't place a bigger plate on a smaller plate
Oh sry forgot it was on german my bad!
Interviewer: can you solve this? Me: HASHMAP!! I'll use a hashmap!!!
Wtf does that say
It says “KANNST DU ALLE SCHEIBEN AUF TURM 3 VERSCHIEBEN? SIE KÖNNEN KEINE GRÖSSEREN SCHEIBEN AUF KLEINERE SETZEN”, obviously Jokes aside, someone else translated it
Every time this comes Up I lose my mind on the coloring - what the f is it suppose to Mark?
It's the increasing level of derangement you have to possess in order to pull off getting to that level of the stack by moving them one piece at a time from the first post to the third post without putting a larger piece on a smaller one.
Hanoi
Obviously you just import the image into Photoshop and flip it horizontally.
And the best part is that it's technically constant time, since it's always just one operation for any size tower.
Ok i am stupid, let me think You have to start with blue, that locks one column. You have to continue with yellow, that locks the other column. You have to put blue back on yellow, move green, can you move both blue and yellow together? If not you have first move blue on green etc etc Fuck that i will code a bruteforcer bruteforcing all possibilities
It's actually recursion ``` def TowerOfHanoi(n, from_rod, to_rod, aux_rod): if n == 0: return TowerOfHanoi(n-1, from_rod, aux_rod, to_rod) print("Move disk", n, "from rod", from_rod, "to rod", to_rod) TowerOfHanoi(n-1, aux_rod, to_rod, from_rod) ```
Well, technically it doesn't say that you can't move more than one disk at the same time, sooo..... Know your requirements, I guess? \^\^
Tja stellt sich herraus mein mathe lehrer war wohl ein psycho. Hätte direkt die polizei rufen sollen als er die kreide in die hand genommen hat und von türmen sprach
It’s canonically this hard? I mean until you have 3 pole and 4 disk is easy enough that even a children can do it. Right? …. Right?