It’s even called tower of Hanoi because of the Vietnam war flashbacks.
It’s a game for kids!
Submitted 11 months ago by genfood@feddit.de to programmer_humor@programming.dev
https://i.imgur.com/0sIVK2s.jpg
Comments
odium@programming.dev 11 months ago
expatriado@lemmy.world 11 months ago
oh, i solved that assignment in school… by finding the algorithm online
Karfkengrumble@lemmings.world 11 months ago
You’re hired, welcome to the team!
LetterboxPancake@sh.itjust.works 11 months ago
I had enough colleagues unable to type exactly what they asked me into whatever search engine they preferred to accept your statement. If you don’t know how to use a search engine go ask for another job.
“Hey pancake, how do I run all tests via gradle?”
Open your browser, head to Google and type “run all tests in gradle”
“Oh, nice. Thank you for your help!”
And the next day the game starts all over again.
ChlorineAddict@lemmy.world 11 months ago
Bonus points for leveraging the work of others contributing to their success
Anonymousllama@lemmy.world 11 months ago
As it should be, there’s way too much reengineering of the wheel. Let the big brains of the past do the heavy lifting
DragonTypeWyvern@literature.cafe 11 months ago
screams in that’s not the point
PapstJL4U@lemmy.world [bot] 11 months ago
Before studying CS, I recognized it as ‘the bioware puzzle’. They were probably copying their own scribbles fron back then.
Haskell was the hardest, but it looked the most beautiful.
lugal@sopuli.xyz 11 months ago
Haskell was the hardest, but it looked the most beautiful.
That pretty much sums that language up
TheBananaKing@lemmy.world 11 months ago
In order to write a haskell program, you must first write the corresponding haskell program.
DarkenLM@artemis.camp 11 months ago
Strange. I find the language hideous, most likely because it resembles math, or maybe because I'm already used to the C-like syntax.
mindbleach@sh.itjust.works 11 months ago
Functional programming flips your brain around backwards, but shader programming will turn it inside-out.
Knusper@feddit.de 11 months ago
hanoi :: Integer -> a -> a -> a -> [(a, a)] hanoi 0 _ _ _ = [] hanoi n a b c = hanoi (n-1) a c b ++ [(a, b)] ++ hanoi (n-1) c b a
nothacking@discuss.tchncs.de 11 months ago
Oh but we don’t play it, we put lighting into rocks and trick them into doing it.
ArmokGoB@lemmy.dbzer0.com 11 months ago
Towers of Hanoi? I don’t think so.
neonblade@lemmus.org 11 months ago
Stack example
stingpie@lemmy.world 11 months ago
Did you guys find this hard? There are only four possible ways to move a ring, two of which are disallowed by the rules. Out of the remaining two, one of them is simply undoing what you just did.
brophy@lemmy.world 11 months ago
Kids get infinite registers and no restrictions on stack ordering. Programmers are constrained to solving it with one register and restrictions on stack put operations.