Edouard Lucas' Tower of Hanoi Solved by Mitsubishi RV-1A Robot

In this video a Mitsubishi RV-1A robot solves Edouard Lucas' Tower of Hanoi puzzle for 7 disks. The Tower of Hanoi is THE classic recursive computer programming problem, or is it n!. The implementation language was MELFA-BASIC IV, which does not support recursion! The robot, running at 80% speed, completes the puzzle in 127 optimal steps, 508 operations, which consumes approximately 448 seconds.

Category:

Science & Technology

Tags:

• Edouard
• Lucas
• Tower
• Hanoi
• Puzzle
• solved
• computer
• program
• recursive
• Mitsubishi
• RV-1A
• MELFA
• ECE
• 569
• 56900
• robotics
• video
• Torre
• Turm
• Rise
• Planet
• Apes

[ImToJelly]

thumbs up if you only looked this up because of rise of the planet of the apes.

[willghass]

Chuck Norris could solve that in one move. Roundhouse kick.

[1999seanboland]

@sydneymassive it's so impresive because america decides to spend a huge amount of money so that a robot can do lame shit like this that humans can do

[linuxlover55]

I've only done the 4 and 5 modes of this game. Pretty challenging...

[rootboysupreme1]

@princetoni09 Yes..., I've solved it plenty of times in 15 moves mentally because I dont have the game physically! Until I can find and buy this game/puzzle it will only exist in my head!

[agkvenom]

caesar brought me here

[eu2cy]

2^n - 1

[hackingtime88]

looks easy

[123markusha]

this is scary

[sydneymassive]

What's so impressive about this?

[Sergeantspoon]

This turned me on...

[dawson850]

We've had this puzzle for years and never known it's name. And yes we got the name from Rise of the Apes. (Good Puzzle)