you have a balance scale with an unknown weight, known to be less than 365. to find the wieght, you have the 6 known wieghts 1,3,9,27,81, and 243.
you have the following allowed moves:
1) place a wieght on one side of the scale or the other.
2) move a wieght from one side of the scale to the other.
3) remove a wieght.
assuming you want to minimize the number of moves, what's the most moves required to find any weight? (that is; what's the worst case scenario for minimizing the number of moves?)