×
Lading in uitvoering

Binary, Hanoi, and Sierpinski, part 2

1 lid

After seeing how binary counting can solve the towers of Hanoi puzzle in the last video, here we see how ternary counting solve a constrained version of the puzzle, and how this gives a way to walk through a Sierpinski triangle graph structure.

Volgende aflevering
S2016E23 - Visualizing the Riemann zeta function and analytic continuation

Afleveringen

Soortgelijke serie (10)

Science étonnante
Science étonnante
Numberphile
Numberphile
CGP Grey
CGP Grey
Mathologer
Mathologer
Déclics
Déclics
Team Umizoomi
Team Umizoomi
In a Nutshell – Kurzgesagt
In a Nutshell – Kurzgesagt
Programa Cautelar
Programa Cautelar
MinutePhysics
MinutePhysics
Numb3rs
Numb3rs