In solving the Chinese ring puzzle, two important facts have to be known.
1. The first ring can be put on or
released from the handle (or the "sword") at any time.
![]() |
![]() |
2. If the first up to the (n - 1)th
rings are released but the nth ring is not, then the (n + 1)th
can be released or put back onto the handle.
![]() |
![]() |
Using these two facts, we can somehow develop
an induction or a coding method to solve the problem.
![]() |
Start
Code : 11111 |
![]() |
Step 1
Release the first ring Code : 01111 Remark : We try to release the fifth ring. However, basing on Fact 2, we have to remove the first, seond and thrid rings first. In other words, we have to solve a 3-ring puzzle first. |
![]() |
Step 2
Release the third ring Code : 01011 |
![]() |
Step 3
Put back the first ring Code : 11011 |
![]() |
Step 4
Release both the first and second rings Code : 00011 Remark : The first three rings are released. |
![]() |
Step 5
Release the fifth ring Code : 00010 |
![]() |
Step 6
Put back the first and second rings Code : 11010 Remark : In order to release the fourth ring, we need to put back the first three rings and start the algorithm again. |
![]() |
Step 7
Release the first ring Code : 01010 |
![]() |
Step 8
Put back the third ring Code : 01110 |
![]() |
Step 9
Put back the first ring Code : 11110 Remark : Actually, we are now solving a 4-ring puzzle! |
![]() |
Step 10
Release the first and seond rings Code : 00110 |
![]() |
Step 11
Release the fourth ring Code : 00100 |
![]() |
Step 12
Put back the first and seond rings Code : 11100 Remark : Here is a 3-ring puzzle again! |
![]() |
Step 13
Release the first ring Code : 01100 Compare this with step 1 |
|
|
Step 14
Release the thrid ring Code : 01000 Compare this with step 2 |
![]() |
Step 15
Put back the first ring Code : 11000 Compare this with step 3 |
![]() |
Step 16
Release both the first and seond rings and finish Code : 00000 Compare this with step 4 |
Original page by LEUNG CHI KIT