LATIN 1998: LATIN'98: Theoretical Informatics pp 11-22

# A chip search problem on binary numbers

• Peter Damaschke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1380)

## Abstract

Suppose that we have an unknown point d in the interval (0, 1) and an unbounded reservoir of chips (pebbles) on both points 0 and 1. In every step, we can either move two pebbles from points x and y to (x + y)/2, or we can ask whether d < x or d > x, but only if there is currently a pebble at x. Our aim is to determine an interval of length 2n including d, and we are interested in the exact number of necessary moves in the worst case, especially for the first values of n.

First we analyze a natural GREEDY strategy solving this problem in roughly n2/6 moves which improves our previous n2/4 result in [5]. On the other hand, n2/12 is a lower bound. Our analysis allows to compute the exact worst-case number of moves g(n) that GREEDY takes for the first values of n, although a nice general expression for this is missing.

GREEDY sends pebbles only to points being binary approximations of the target d. Moreover, our analysis will show that GREEDY is optimal among all strategies sharing this property. Hence any such strategy needs γ(n2) moves in the worst case. It might seem that sending pebbles to other points brings no advantages. So it is surprising that, without the mentioned restriction, we can achieve an asymptotic result of O(n1+2/√log n) moves, by an acceleration technique. Hence GREEDY is not optimal in general, nevertheless it seems to be the best choice for small (i.e. practical?) n, since it is simple, and we have no strategy beating g(n) if n < 20. An open problem is to determine the maximum n for which g(n) moves are optimal.

In a final section we discuss a way to save tests if d is very small, and we briefly consider a variant of the problem where a test at x destroys a pebble lying there.

To our best knowledge, the present problem has not been studied before

## Keywords

Binary Search Search Problem Unknown Point Binary Expansion Candidate Interval
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
J.A.Aslam, A.Dhagat: Searching in the presence of linearly bounded errors, 23rd ACM STOC 1991, 486–493Google Scholar
2. 2.
A.Bar-Noy, F.K.Hwang, I.Kessler, S.Kutten: A new competitive algorithm for group testing, Discrete Applied Math. 52 (1994)Google Scholar
3. 3.
R.A.Baeza-Yates, J.C.Culberson, G.J.E.Rawlins: Searching in the plane, Info. and Computation 106 (1993), 234–252
4. 4.
J.L.Bentley, A.C.Yao: An almost optimal algorithm for unbounded searching, Info. Proc. Letters 5 (1976), 82–87
5. 5.
P.Damaschke: The algorithmic complexity of chemical threshold testing, 3rd Italian Conference on Algorithms and Complexity CIAC'97, Rome 1997, Lecture Notes in Computer Science 1203 (Springer 1997), 205–216Google Scholar
6. 6.
J.A.Decker Jr.: Hadamard transform spectrometry: a new analytical technique, Analytical Chemistry 44 (1972), 127–134Google Scholar
7. 7.
D.Z. Du, F.K. Hwang: Competitive group testing, Discrete Applied Math. 45 (1993)Google Scholar
8. 8.
D.Z.Du, H.Park: On competitive group testing, SIAM J. Comp. 23 (1994), 1019–1025
9. 9.
D.Z.Du, G.L.Xue, S.Z.Sun, S.W.Cheng: Modifications of competitive group testing, SIAM J. Comp. 23 (1994), 82–96
10. 10.
S.W.Hornick, S.R.Maddila, E.P.Mücke, H.Rosenberger, S.S.Skiena, I.G.Tollis: Searching on a tape, IEEE Trans. Comp. 39 (1990), 1265–1271
11. 11.
T.C.Hu, M.L.Wachs: Binary search on a tape, SIAM J. Computing 16 (1987), 573–590
12. 12.
E.Koutsoupias, C.Papadimitriou, M.Yannakakis: Searching a fixed graph, Proc. 23rd ICALP'96, Lecture Notes in Computer Science 1099 (Springer 1996), 280–289Google Scholar
13. 13.
E.Triesch: A group testing problem for hypergraphs of bounded rank, Discrete Applied Math. 66 (1996), 185–188