Guess the Most Likely One First: Optimal Elimination Order for a Classroom Guessing Puzzle

Proves via the rearrangement inequality that the optimal guessing order in sequential search is decreasing prior probability; parallels Huffman coding and verifies with exhaustive search and simulation.

Authors

Amirhossein MoradiSizkouhi (ORCID: https://orcid.org/0009-0000-3936-1733)

Institutions

Imam Khomeini International University (IR)

Publication Details

Journal: Zenodo (CERN European Organization for Nuclear Research)
Published: 2026-09-14
DOI: https://doi.org/10.5281/zenodo.22750433
Primary Topic: Machine Learning and Algorithms
Type: preprint

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

preprint

Guess the Most Likely One First: Optimal Elimination Order for a Classroom Guessing Puzzle

Amirhossein MoradiSizkouhi

Sep 14, 2026

Zenodo (CERN European Organization for Nuclear Research)

Machine Learning and Algorithms

preprint

Guess the Most Likely One First: Optimal Elimination Order for a Classroom Guessing Puzzle

Amirhossein MoradiSizkouhi

September 14, 2026preprint en

Abstract

Zenodo (CERN European Organization for Nuclear Research)

Imam Khomeini International University (IR)

Reduced inequalities

Machine Learning and Algorithms

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Guess the Most Likely One First: Optimal Elimination Order for a Classroom Guessing Puzzle — Amirhossein MoradiSizkouhi · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS