12-04-2009, 07:32 PM
The algorithm for solving it in the least turns is call a binary search. Just guess the middle number of the remaining set. So, for example, from a set of 0 to 255 numbers, it will never take more than 8 guesses by guessing 128, 64, 32, 16, 8, 4, 2, 1 or 0.