Phase transition in the Countdown problem

TL;DR

This paper investigates a combinatorial problem inspired by the Countdown game, revealing a phase transition in the probability of success as the size of the number set varies, with maximum efficiency near the critical point.

Contribution

It introduces a phase transition framework to analyze the Countdown problem, combining numerical simulations and analytical expressions to characterize the threshold behavior.

Findings

Probability of winning transitions sharply from zero to one at a critical set size.

Maximum computational efficiency occurs near the phase transition point.

Analytical models accurately predict the finite-size behavior and asymptotic limit.

Abstract

Here we present a combinatorial decision problem, inspired by the celebrated quiz show called the countdown, that involves the computation of a given target number T from a set of k randomly chosen integers along with a set of arithmetic operations. We find that the probability of winning the game evidences a threshold phenomenon that can be understood in the terms of an algorithmic phase transition as a function of the set size k. Numerical simulations show that such probability sharply transitions from zero to one at some critical value of the control parameter, hence separating the algorithm's parameter space in different phases. We also find that the system is maximally efficient close to the critical point. We then derive analytical expressions that match the numerical results for finite size and permit us to extrapolate the behavior in the thermodynamic limit.