Result: Searching for three objects.

Title:
Searching for three objects.
Authors:
Liu, Wenan, Nie, Zankan
Publisher Information:
Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan
Subject Terms:
Combinatorics in computer science, Search theory, Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.), Enumerative combinatorics, sequential algorithm, combinatorial search
Document Type:
Academic journal Article
File Description:
application/xml
Access URL:
https://zbmath.org/2121683
Accession Number:
edsair.c2b0b933574d..4f6cbd01c3b4da650d358bdf631dfae9
Database:
OpenAIRE

Further Information

Summary: It is proved that the minimum number of weighings required to find three objects is equal to the information-theoretic bound for an infinite set of \(n\)'s, by establishing some concise and powerful methods of searching. Moreover, a slightly modified problem is also considered. It is shown that for all integers \(n\geq 3\), the corresponding minimum number of weighings is either equal to the information-theoretic bound, or exceeds it by 1 and the information-theoretic bound is achievable for infinitely many intervals.