Binary, Hanoi and Sierpinski, part 1

Name: Binary, Hanoi and Sierpinski, part 1
Uploaded: 2016-11-25T00:00:00.000Z
Description: How counting in binary can solve the famous Tower of Hanoi puzzle.

How counting in binary can solve the famous Tower of Hanoi puzzle.

Nov 25, 2016

Lesson by Grant Sanderson

Source

Previous Lesson

Where my explanation of Grover's algorithm failed

Thanks

Special thanks to those below for supporting this lesson.

CrypticSwarm

Ali Yahya

Dave Nicponski

Juan Batiz-Benet

Yu Jun

Othman Alikhan

Markus Persson

Joseph John Cox

Luc Ritchie

Einar Wikheim Johansen

Rish Kundalia

Achille Brighton

Kirk Werklund

Ripta Pasay

Felipe Diniz

Chris

Curtis Mitchell

Ari Royce

Bright

Myles Buckley

Robert P Zuckett

Andy Petsch

Otavio good

Karthik T

Steve Muench

Viesulas Sliupas

Steffen Persch

Brendan Shah

Andrew Mcnab

Matt Parlmer

Naoki Orai

Dan Davison

Jose Oscar Mur-Miranda

Aidan Boneham

Brent Kennedy

Henry Reich

Sean Bibby

Paul Constantine

Justin Clark

Mohannad Elhamod

Denis

Ben Granger

Jeffrey Herman

Jacob Young