Seven orbs: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) No edit summary |
Oscarlevin (talk | contribs) No edit summary |
||
Line 8: | Line 8: | ||
{{Needs answer}} | {{Needs answer}} | ||
{{Solution | | {{Solution | | ||
Let A be set of orbs for which there are 3 or more others the same colour. | Let A be the set of orbs for which there are 3 or more others the same colour. | ||
Let B be set of orbs for which there are 1 or 2 others the same colour. | Let B be the set of orbs for which there are 1 or 2 others the same colour. | ||
Let X be set of orbs for which there are no others the same colour. | Let X be the set of orbs for which there are no others the same colour. | ||
Goal is to prove that some orb is in A. | Goal is to prove that some orb is in A. |
Current revision as of 13:32, 11 October 2010
Puzzle
You enter a magical cave to find seven orbs. A wizard tells you that each orb is colored on the inside, and that four or more of the orbs have the same color. Also, when two orbs of the same color are brought into contact with each other, they will glow, revealing the color. If two orbs touch but have different color, nothing happens. The orbs are heavy, so you can only touch two at a time. What is the least number of comparisons needed to find one of the orbs of the majority color?
Help
Solution
References
Problem Solving by Thomas DeFranco and Charles Vinsonhaler.