A guessing game with two secret numbers is a game played between a
questioner and a responder. The two players first agree upon the set,
,
in which the game will be played, as well as the number of questions,
, which
will be asked by the questioner. The responder first chooses two distinct numbers from
. The
questioner then asks questions of the form “How many of your chosen numbers are in the
set
?”
to which the responder answers truthfully. The goal for the
questioner is to determine the responder’s two numbers using at most
questions. We study a continuous version of this game where
is the closed interval of real numbers from 0 to 1. We introduce tools to
study this game and use them to examine strategies for the questioner using
a geometric approach. We establish a condition that must be satisfied by
optimal strategies and give a strategy that can be made arbitrarily close to
optimal.