Several authors have studied a special form of a combinatorial game called the Matching Identification Problem (MIP). It is also a special case of a knowledge acquisition problem. The problem involves identifying a chosen subset of size K out of N symbols through a series of inquiries and corresponding responses. Previous heuristics and optimal algorithms for minimizing the average inquiries required were proposed for only the unOrdered MIP, where the order of the K symbols in each subset is irrelevant. In this paper, the Ordered MIP is introduced, whose initial solution space is K! times larger, but those structure allows it to gain more information at each inquiry. Three previously proposed heuristics are extended from the Unordered MIP and applied to the Ordered MIP in a computational study. The purpose is to observe how the availability of extra information can help reduce a solution space more quickly. The results show that in many cases the Ordered MIP can be solved more quickly than the corresponding Unordered MIP. This implies that information can be valuable in reducing a large solution space quickly.
