## Lecture 7: Chinese Rings Puzzle

Lecture 7: Chinese Rings Puzzle
• Currently 4.0/5 Stars.
8175 views, 2 ratings - 01:22:03
Part of video series ArsDigita Discrete Math Course
Taught by ArsDigita
Learn about the Chinese Rings Puzzle and how it relates to Discrete Math.
• What is an algorithm for the Tower of Hanoi problem?
• How do you write a recursive program for solving the Towers of Hanoi problem?
• What is the seven rings problem and how do you solve it?
• What is the Chinese rings puzzle and how do you solve it?
• How can you remove all the rings in the seven rings problem using recursion?
• What are the two possible moves in the seven rings problem?
• What does the seven rings problem look like using six binary digits?
• How do you get the hardest ring off of the Chinese rings puzzle?
• What is the time complexity for the Chinese rings puzzle?
• How can you use induction to find the number of steps needed to solve the seven rings problem?
• Why does it take 42 moves to solve the Chinese rings puzzle with six rings?
• How can you set up a spinner with 0s and 1s so if the spinner lands on a boundary between two regions, it picks either the right or the left region is selected?
• What is a gray code?
This video starts off with an explanation of some ideas behind how to solve a variation of the Towers of Hanoi problem. Then, the meat of this lecture deals with the Chinese rings puzzle or seven rings problem. Theory behind this problem and analysis of the problem using binary place-holder digits. This discussion really explains clearly how to solve this puzzle. A really long and hairy time complexity computation is done in depth using a recurrence equation, some algebra, and induction. Some applications of the Chinese rings puzzle are the shown.
• Currently 4.0/5 Stars.
Reviewed by MathVids Staff on April 16, 2009.  