Pith. sign in

REVIEW

AE quitas: Two-Player Counterfeit Coin Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.04973 v1 pith:WLIQCUHL submitted 2022-01-12 math.HO math.CO

AE quitas: Two-Player Counterfeit Coin Games

Kyle Burke , Tanya Khovanova , Joshua Lee , Richard J. Nowakowski , Amelia Rowland , Craig Tennenhouse This is my paper
classification math.HO math.CO
keywords coincoinscounterfeitgamesconditionknowledgeavailabilitydepending
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We discuss games involving a counterfeit coin. Given one counterfeit coin among a number of otherwise identical coins, two players with full knowledge of the fake coin take turns weighing coins on a two-pan scale, under the condition that on every turn they reveal some information to an Observer with limited prior knowledge about the coins. We study several games depending on the types of the counterfeit coin, the end-game condition, and the availability of extra genuine coins. We present the winning positions and the Grundy numbers for these games.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.