Elegant Solution for the Snooker ball Problem

  • Context: Graduate 
  • Thread starter Thread starter gautam89
  • Start date Start date
  • Tags Tags
    Ball
Click For Summary
SUMMARY

The discussion presents an elegant solution to the Snooker Ball Problem, which involves identifying a non-standard weight ball among a set of identical balls using a scale balance. Two propositions are established: Proposition 1 states that for a known relative weight of one non-standard ball, a minimum of n weighings is required for a set size of 3^n or less. Proposition 2 addresses an unknown relative weight, requiring n + 1 weighings for a set size defined by a specific formula. The proofs utilize ternary partitions and weight types to systematically identify the non-standard ball.

PREREQUISITES
  • Understanding of Ternary Partitioning
  • Familiarity with Scale Balances
  • Knowledge of Mathematical Proof Techniques
  • Concept of Weight Types in Problem Solving
NEXT STEPS
  • Study advanced techniques in combinatorial optimization
  • Explore mathematical proofs related to partition theory
  • Learn about recursive algorithms in problem-solving
  • Investigate variations of the Snooker Ball Problem with multiple non-standard weights
USEFUL FOR

Mathematicians, computer scientists, educators, and anyone interested in combinatorial problem-solving and optimization techniques.

gautam89
Snooker balls Problems – An Approach to Elegant Solutions:

Problem Definition: In a set S of snooker balls, all of the same standard weight, there is one ball of non-standard weight.

Using a Scale Balance, find the non-standard ball with minimum number of trials- Provide a formula and a proof.
---------------------------------------------------
Proposition 1. Set S contains One non-standard ball of known relative weight -Identify non-standard :
Solution: For Quantity = 3 (to power n), or less;
Min weighing required = n.
Proposition 2: Set S contains One non-standard ball- of unknown relative weight; find the ball and identify its relative (heavier or lighter) weight ?:
Solution: For Qty = ( 3(power n) + 3(n-1) + 3 (n-2) … 3(2) + 3(1) ) or less;
Min weighing required = n +1.
---------------------------------------------------------
An approach to proofs of solutions:

Definition 1: (Ternary partition)
Divide the set S into three subsets A, B, and C, where
1. Qty(S) = Qt(A)+Qty(B) +Qty(C), and
2. Qty(A) = Qty(B) >= 1/3 x Qty(S), and
3. Qty(C) = Qty(A) - i; where i = 0,1 or 2.

Proof For Proposition 1: Weigh A with B. This will identify which of the subsets A, B, or C has the non-standard (with known relative weight) ball. – Recursively use n-1 weighings to find the non-standard ball (of known relative weight).

Definition 2 : (“Weight type”)
1. A ball is of “ heavier weight type” when it can NOT be lighter ball.
2. A ball is of “ lighter weight type” when it can NOT be heavier ball.
3. A subset of balls is called of a specific “weight type” if all the balls in that subset is of that “weight type”

Proof For proposition 2:
1. Divide the set S into its Ternary subsets A, B, C (Definition 1), and weigh set A & B.
2. If A and B are Not equal, then using the “weight type” concept and Proposition 1, one can “cross-weigh” subsets of A, B and C n times, to find the non-standard ball from A or B, and identify if it is heavier or lighter ball
3. If subsets A and B are equal then the non-standard ball is in C, and again one can use “cross weighings” and Proposition 1, n times to find and identify the relative weight of the non-standard ball in subset C.

What about problem when there are TWO non-standard balls (of equal weights)...

Gautam Pandya
---------------------
 
Physics news on Phys.org
gautam89 said:
Snooker balls Problems – An Approach to Elegant Solutions:

Problem Definition: In a set S of snooker balls, all of the same standard weight, there is one ball of non-standard weight.

Using a Scale Balance, find the non-standard ball with minimum number of trials- Provide a formula and a proof.
---------------------------------------------------
Proposition 1. Set S contains One non-standard ball of known relative weight -Identify non-standard :
Solution: For Quantity = 3 (to power n), or less;
Min weighing required = n.
Proposition 2: Set S contains One non-standard ball- of unknown relative weight; find the ball and identify its relative (heavier or lighter) weight ?:
Solution: For Qty = ( 3(power n) + 3(n-1) + 3 (n-2) … 3(2) + 3(1) ) or less;
Min weighing required = n +1.
---------------------------------------------------------
An approach to proofs of solutions:

Definition 1: (Ternary partition)
Divide the set S into three subsets A, B, and C, where
1. Qty(S) = Qt(A)+Qty(B) +Qty(C), and
2. Qty(A) = Qty(B) >= 1/3 x Qty(S), and
3. Qty(C) = Qty(A) - i; where i = 0,1 or 2.

Proof For Proposition 1: Weigh A with B. This will identify which of the subsets A, B, or C has the non-standard (with known relative weight) ball. – Recursively use n-1 weighings to find the non-standard ball (of known relative weight).

Definition 2 : (“Weight type”)
1. A ball is of “ heavier weight type” when it can NOT be lighter ball.
2. A ball is of “ lighter weight type” when it can NOT be heavier ball.
3. A subset of balls is called of a specific “weight type” if all the balls in that subset is of that “weight type”

Proof For proposition 2:
1. Divide the set S into its Ternary subsets A, B, C (Definition 1), and weigh set A & B.
2. If A and B are Not equal, then using the “weight type” concept and Proposition 1, one can “cross-weigh” subsets of A, B and C n times, to find the non-standard ball from A or B, and identify if it is heavier or lighter ball
3. If subsets A and B are equal then the non-standard ball is in C, and again one can use “cross weighings” and Proposition 1, n times to find and identify the relative weight of the non-standard ball in subset C.

What about problem when there are TWO non-standard balls (of equal weights)...

Gautam Pandya
---------------------
Notes on Elegant Proof of Snooker Ball problem
Note 1: Exceptions to the Ternary partitions:
For Qty(S) = 7, Ternary partition is 7 = 2 + 2 + 3
For Qty(S) = 10. Ternary partistion is 10 = 3 + 3 + 4

Note 2: let p = MIN ((3(power n-1), Qty(C)). Cross weighing p balls from sets A, B and C, and using Proposition 1, One can easily prove proposition 2.
Gautam Pandya
 
Last edited by a moderator:
gautam89 said:
Notes on Elegant Proof of Snooker Ball problem
Note 1: Exceptions to the Ternary partitions:
For Qty(S) = 7, Ternary partition is 7 = 2 + 2 + 3
For Qty(S) = 10. Ternary partistion is 10 = 3 + 3 + 4

Note 2: let p = MIN ((3(power n-1), Qty(C)).

Note 3: If A and B are of different weights, put aside p number of balls from the higher weight set, transfer p number of balls from lower weight to higher weight set, and transfer p balls from the set C (of standard weights) to the lower weight set.

Gautam Pandya

Note 4: Weigh the modified sets A and B. If they weigh opposite to their earlier weight types then the non-standard ball must be one of the p balls transferred from the lower weight type. If modified sets are equal then the non-standard ball is one of the p balls put aside from the higher weight type. In these two cases, Recurssively one can find the non-standard ball and identify its weight type.

Note 5: If modified sets weigh the same way as the original sets A and B, then non-standard ball is amongs the "remaining" balls in A and B. In this case, take
p = 3(power n-2), and repeat steps in Notes 3 and 4 above, and recurssively prove the proposition 2.
Note 6: If A = B the repeat steps then A and B has all standard balls and repeat steps in Note 3 and 4 above for Set C.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
7
Views
2K
  • · Replies 29 ·
Replies
29
Views
6K