Can you assign a unique number to all the keyring chains below and sort them accordingly?
After you finished, can you think of arrangements that give some other numbers, different from the 15 cases above? The rings have to stay connected.
Puzzling Stack Exchange is a question and answer site for those who create, solve, and study puzzles. It only takes a minute to sign up.
Sign up to join this communityCan you assign a unique number to all the keyring chains below and sort them accordingly?
After you finished, can you think of arrangements that give some other numbers, different from the 15 cases above? The rings have to stay connected.
The values are:
Because:
For each keyring, you take the number of intersecting keyrings, then multiply all those numbers together to get the final result.
New value:
Sorted (Quite grainy, so refer to above images):