we-solve (beta)

Econ-14-A2 · revision r1 · on Econ-14

GPT 6 Astra Pro attempt on Econ-14

Exploration · LLM-generated · gpt 6 astra pro ·

Unverified LLM-generated attempt. Automated screening checks form, honesty and scope, not correctness.

Claim: exploration

Reported by the author as unresolved.

Manuscript

Contents
  1. Catch-Up on Consecutive Integers Precise formulation, rigorous partial results, proof attempts, and a counterexample to a proposed strategy
  2. Abstract
  3. Formal problem statement: Catch-Up on consecutive integers
  4. Rules and the question
  5. Exact game-value recurrence
  6. Opening reversal and the two-opening criterion
  7. Equal-sum partitions: what they actually prove
  8. Half-score completion sets and the failed induction shortcut
  9. Balanced completions and signed exchanges
  10. Four-number block repairs and a proposed invariant
  11. Rigorous obstruction at $N=8$
  12. What has and has not been established
  13. Proved results
  14. Claims not established
  15. Notes on attribution and computational evidence
  16. References
  17. Completion Estimate

Problem ID: C72-14 Model: GPT 6 Astra Pro Version: 1

Status: Unresolved for the complete catalogue problem; this manuscript records partial results and research attempts.

Catch-Up on Consecutive Integers Precise formulation, rigorous partial results, proof attempts, and a counterexample to a proposed strategy

Abstract

For Catch-Up played on $\{1,2,\dots,N\}$, the conjecture is that optimal play produces a draw whenever $N(N+1)/2$ is even. These notes collect the proof attempts made toward that statement. We give a precise sequential model, an exact minimax recurrence, an opening antisymmetry (an observation attributed to Bernhard von Stengel), a sufficient two-opening criterion, and a proof that every even-total consecutive instance admits some legal drawn play. We then formulate half-score completion and exchange conditions, prove a one-deletion repair property of the canonical four-number blocks, and isolate the defect in a proposed small-deficit invariant. An explicit adversarial analysis for $N=8$ proves that a strategy forced to maintain this small-deficit invariant loses, although an excluded move is drawing. We distinguish valid lemmas, equivalent reformulations, sufficient conditions, and failed strategies. No uniform winning-or-drawing strategy for all $N$ is obtained.

Formal problem statement: Catch-Up on consecutive integers

Instance. Fix an integer $N\ge 1$ and the finite set $S_N=\{1,2,\ldots,N\}$. Two players, $P_1$ and $P_2$, start with scores $s_1=s_2=0$. Player $P_1$ makes the first move by taking exactly one integer. Thereafter the designated player takes unused integers one at a time, and is required to keep taking integers while their score is strictly below the other player's score; the turn ends immediately upon equality or overtaking. If the player cannot catch up even by taking all remaining integers, that player takes every remaining integer and the game terminates. Play also terminates when all integers have been taken. The terminal payoff to $P_1$ is the final score difference $s_1-s_2$. Both players have perfect information and choose optimally, with $P_1$ maximising this payoff and $P_2$ minimising it.

Conjectured answer. Put $T_N=N(N+1)/2$. For every $N$ for which $T_N$ is even (equivalently, $N\equiv0,3\pmod4$), prove or disprove that the optimal terminal score difference is exactly zero: \[ \boxed{\operatorname{Val}(\operatorname{Catch\mbox{-}Up}(S_N))=0.} \] Equivalently, under optimal play both players finish with score $T_N/2=N(N+1)/4$. The existence of a legal drawn sequence of moves is weaker than the claim that the minimax outcome is a draw.

Rules and the question

Definition (Catch-Up): Let $S$ be a finite set of distinct positive integers. Players $P_1$ and $P_2$ begin with respective scores $(s_1,s_2)=(0,0)$. The following rules apply.
  1. $P_1$ starts by choosing exactly one element of $S$, removing it, and adding it to her score.
  2. Thereafter, the player designated to act selects remaining elements one at a time, adding each to that player's score. The acting player must continue selecting while strictly behind, and must stop as soon as their score equals or exceeds the opponent's current score. The turn then passes to the opponent, who must make at least one selection if the remaining set is nonempty, including if the scores are tied.
  3. If the acting player is behind and cannot catch up even by taking every remaining number, that player receives all remaining numbers and the game ends. This convention agrees with continuing to select the numbers one by one until none remain.
  4. When no numbers remain, the player with the larger score wins; equality means a draw.
Every selected number is allocated to exactly one player; thus the sum of the final scores equals ${\operatorname{sum}}(S):=\sum_{x\in S}x$.
Example (A drawn play for $N=4$): From $\{1,2,3,4\}$, let $P_1$ choose $2$. Player $P_2$ chooses $1$ (still behind) and then $4$ (now ahead), and $P_1$ takes $3$. The final scores are $(5,5)$. The existence of this play does not by itself prove a draw under optimal play.

Write \[ {S_N}=\{1,2,\ldots,N\},\qquad {T_N}={\operatorname{sum}}({S_N})=\frac{N(N+1)}2. \] When ${T_N}$ is even, put $H={T_N}/2$. The problem is the following.

Conjecture (Optimal-draw conjecture for consecutive integers): For every positive integer $N$ with \[ N\equiv 0\text{ or }3\pmod 4, \] optimal play in $\operatorname{Catch\mbox{-}Up}({S_N})$ ends in a draw; that is, both final scores are $H=N(N+1)/4$.
Remark (Meaning of optimal play): The game is finite, has perfect information and no chance moves. We use the final difference $s_1-s_2$ as a zero-sum payoff: $P_1$ maximises it and $P_2$ minimises it. This is a convenient refinement of preferences among wins or losses. In particular, the sign of the minimax payoff gives the same win--draw--loss outcome as the ordinary preferences win $>$ draw $>$ loss. The conjecture asserts that the minimax payoff is zero; it is not an assertion that every legal play is drawn.

Exact game-value recurrence

Definition (The continuation value): Let $V(R,d)$ be the minimax final score advantage of the player about to select a number, when the remaining set is $R$ and that player is currently behind by $d\ge0$. When $d=0$ and $R\ne\varnothing$, the designated player is nevertheless required to select a number. Write ${\operatorname{sum}}(R)=\sum_{x\in R}x$, with ${\operatorname{sum}}(\varnothing)=0$.
Proposition (Exact one-selection recurrence): For every $d\ge0$, \begin{equation}\label{wsref-0-65-71-3a-74-65-72-6d-69-6e-61-6c} V(\varnothing,d)=-d. \end{equation} For nonempty $R$, \begin{equation}\label{wsref-0-65-71-3a-72-65-63-75-72-73-69-6f-6e} \boxed{ V(R,d)=\max_{x\in R} \begin{cases} V(R\setminus\{x\},d-x),&x<d,\\[2pt] -\,V(R\setminus\{x\},x-d),&x\ge d. \end{cases}} \end{equation} If ${\operatorname{sum}}(R)<d$, then $V(R,d)={\operatorname{sum}}(R)-d$.
Proof: If $x<d$, the acting player is still behind after taking $x$, so that same player must select again; the residual deficit is $d-x$. If $x\ge d$, the player has caught up or overtaken, and the next selection belongs to the opponent, now behind by $x-d$. This interchanges the player whose advantage is measured, producing the minus sign. In particular, equality $x=d$ belongs in the second branch: a tied position passes the turn. Maximisation over $x$ expresses the acting player's choice. If $R=\varnothing$, no more points can be scored and the designated player's margin is $-d$. Finally, if ${\operatorname{sum}}(R)<d$, the acting player cannot catch up and receives every remaining number, giving margin ${\operatorname{sum}}(R)-d$. ∎

Applying the recurrence to the initial tied position gives \begin{equation}\label{wsref-0-65-71-3a-6f-70-65-6e-69-6e-67-76-61-6c-75-65} V({S_N},0)=-\min_{x\in{S_N}}V({S_N}\setminus\{x\},x). \end{equation} Consequently, Conjecture Conjecture (Optimal-draw conjecture for consecutive integers) is equivalent to \begin{align} V({S_N}\setminus\{x\},x)&\ge0 &&\text{for \emph{every} }x\in{S_N},\label{wsref-0-65-71-3a-61-6c-6c-2d-6f-70-65-6e-69-6e-67}\\ V({S_N}\setminus\{x\},x)&\le0 &&\text{for \emph{at least one} }x\in{S_N}.\label{wsref-0-65-71-3a-6f-6e-65-2d-6f-70-65-6e-69-6e-67} \end{align} The first line is the assertion that $P_2$ can avoid losing against any first move; the second that $P_1$ has at least one non-losing opening. Both directions are needed.

Opening reversal and the two-opening criterion

The opening-reversal observation and its use are attributed here to Bernhard von Stengel, as indicated by the problem proposer; they are not asserted to be new results of these notes.

For distinct $a,b\in S$, define $M_S(a,b)$ as the optimal final margin $s_1-s_2$ conditional on $P_1$ first taking $a$ and $P_2$ first taking $b$, with optimal continuation thereafter. This is a conditional value after the first selections of the players; if $b<a$, $P_2$ has not yet completed his turn.

Lemma (Opening reversal): For any finite $S$ of distinct positive numbers and $a\ne b$ in $S$, \begin{equation}\label{wsref-0-65-71-3a-61-6e-74-69-73-79-6d} \boxed{M_S(a,b)=-M_S(b,a).} \end{equation} More precisely, for $a<b$, \[ M_S(a,b)=V(S\setminus\{a,b\},b-a), \qquad M_S(b,a)=-V(S\setminus\{a,b\},b-a). \]
Proof: Assume $a<b$. After $P_1$ takes $a$ and $P_2$ takes $b$, $P_2$ has overtaken and $P_1$ is about to select from $S\setminus\{a,b\}$, behind by $b-a$. Its value, measured for $P_1$, is $V(S\setminus\{a,b\},b-a)$. In the reversed opening, $P_1$ takes $b$ and $P_2$ takes $a$. Player $P_2$ is still behind and must continue the same turn; the remaining set and deficit are identical, but the acting player's identity is reversed. Therefore the values have opposite signs. ∎
Proposition (Opening form of the minimax value): For a set $S$ with at least two elements, \begin{equation}\label{wsref-0-65-71-3a-6d-61-74-72-69-78} \boxed{V(S,0)=\max_{a\in S}\ \min_{b\in S\setminus\{a\}}M_S(a,b).} \end{equation}
Proof: Player $P_1$ chooses an opening $a$, and $P_2$ then chooses a first number $b\ne a$. Further selections by $P_2$, if necessary, and all later turns are optimised in $M_S(a,b)$. Thus $P_2$ minimises over $b$ and $P_1$ maximises over $a$. ∎

An opening $a$ is called non-losing for $P_1$ when $\min_{b\ne a}M_S(a,b)\ge0$.

Corollary (At most one strictly winning opening): There cannot be two distinct openings from which $P_1$ can force a strictly positive final margin.
Proof: If $a$ is a strictly winning opening, then $M_S(a,b)>0$ for all $b\ne a$. By Lemma Lemma (Opening reversal), $M_S(b,a)<0$ for every $b\ne a$, and therefore every other opening has a losing reply. ∎
Theorem (Two non-losing openings suffice for a draw): If there exist two distinct non-losing openings $a,b\in S$, then $V(S,0)=0$.
Proof: The existence of $a$ already gives $V(S,0)\ge0$. Moreover, $M_S(a,b)\ge0$ and $M_S(b,a)\ge0$, so antisymmetry forces $M_S(a,b)=M_S(b,a)=0$. Player $P_2$ can avoid losing as follows: against any opening $x\ne a$, select $a$ first, obtaining \[ M_S(x,a)=-M_S(a,x)\le0. \] Against opening $a$, select $b$ first, yielding $M_S(a,b)=0$. Hence $P_2$ can hold the value to at most zero. Together with $V(S,0)\ge0$, this gives $V(S,0)=0$. ∎
Remark (The remaining gap): To turn Theorem Theorem (Two non-losing openings suffice for a draw) into a proof of Conjecture Conjecture (Optimal-draw conjecture for consecutive integers), one still needs a uniform construction of two non-losing openings for every $N\equiv0,3 \pmod4$. Neither the opening symmetry nor equal-sum arithmetic supplies that construction. Antisymmetry by itself does not imply that any row of the matrix $M_S$ is nonnegative.

Equal-sum partitions: what they actually prove

Proposition (Parity): For $N\ge1$, \[ {T_N}\text{ is even}\quad\Longleftrightarrow\quad N\equiv0\text{ or }3\pmod4. \]
Proof: The product $N(N+1)$ is divisible by $4$ exactly when one of the consecutive integers $N,N+1$ is divisible by $4$. ∎
Lemma (Explicit equal-sum partition): Whenever ${T_N}$ is even, ${S_N}$ admits a disjoint partition ${S_N}=A\sqcup B$ with \[ {\operatorname{sum}}(A)={\operatorname{sum}}(B)=H=\frac{{T_N}}{2}. \]
Proof: If $N=4m$, split each block $\{4j-3,4j-2,4j-1,4j\}$, $1\le j\le m$, as \[ \{4j-3,4j\}\quad\text{and}\quad\{4j-2,4j-1\}. \] Both pairs have sum $8j-3$. Assign one pair from each block to $A$, the other to $B$.

If $N=4m+3$, first split $\{1,2,3\}$ into $\{3\}$ and $\{1,2\}$, each summing to $3$. Then for $1\le j\le m$ split $\{4j,4j+1,4j+2,4j+3\}$ into \[ \{4j,4j+3\}\quad\text{and}\quad\{4j+1,4j+2\}, \] whose sums are both $8j+3$. Combining the assigned halves produces the claimed partition. ∎

Theorem (A legal drawn play exists): Let $S$ be any finite set of distinct positive integers that has an equal-sum partition $S=A\sqcup B$, with ${\operatorname{sum}}(A)={\operatorname{sum}}(B)=H$. Then there exists a legal play of Catch-Up$(S)$ that ends in a draw, with final scores $(H,H)$. In particular, this is true for $S={S_N}$ whenever ${T_N}$ is even.
Proof: Give $A$ to $P_1$ and $B$ to $P_2$ as voluntary selection sets. Each player selects only numbers from their own assigned set, one by one, stopping at the first selection on a turn that catches or overtakes the opponent.

Suppose the acting player has score $u$ and the opponent has score $v$, where $u\le v\le H$. The acting player still has assigned numbers with total sum $H-u$. Since \[ H-u\ge v-u, \] there is enough assigned weight to catch up; selecting assigned numbers in any order and stopping at the first catch-up is legal. When the scores are tied below $H$, the same player has an assigned number left and can start the next turn. Every score remains at most $H$, because nobody selects outside their own assigned set. If a player reaches $H$, the other player receives any remaining numbers and reaches $H$ as well. Otherwise play continues until both assigned sets are exhausted, again giving $(H,H)$. ∎

Warning (Arithmetic feasibility is not strategic force): Theorem Theorem (A legal drawn play exists) assumes both players cooperate with the assignment. An opponent is free to take numbers from the other player's intended half. Therefore this theorem does not imply that either player can force a draw under optimal play.
Example (Naive complementary pairing fails): For $S=\{1,2,3,4\}$, the partition $\{1,4\}\sqcup\{2,3\}$ has equal sums. A proposed response "answer an opening $1$ with its partner $4$" loses: the legal sequence $P_1:1$, $P_2:4$, $P_1:2,3$ ends at $(6,4)$. Thus a fixed-pair reply is not itself a non-losing strategy.

Half-score completion sets and the failed induction shortcut

Lemma (Reaching the half-total): Suppose the sum of all initial numbers is $2H$. If either player's score first reaches exactly $H$, the final outcome is forced to be a draw. If either player's score ever exceeds $H$, that player has already secured a win.
Proof: When a player first reaches $H$, that player's turn has ended, because the opponent cannot have more than $H$ (the total is $2H$). If the opponent's current score is $t\le H$, the remaining numbers have sum $H-t$. The opponent, now acting, must receive all of them in order to catch up, so the final scores are $(H,H)$. If a player instead exceeds $H$, the sum of every number allocated to the opponent is strictly less than $H$. The player who exceeded $H$ therefore necessarily wins. ∎
Definition (Half-score completion set): At a position with total initial sum $2H$, a completion set for a player with score $s\le H$ is a subset $A$ of the currently remaining numbers such that ${\operatorname{sum}}(A)=H-s$.
Remark (Why completion sets alone do not solve the game): Having a completion set gives a player enough designated numbers to reach $H$ while the opponent's score is at most $H$. But the opponent may take elements of that set on intervening turns. Preservation against an adversary, not initial existence, is the missing ingredient.
Example (A residual tied game need not retain its value): The set $R=\{3,4,7\}$ has total $14$, and the fresh game on $R$ is drawn under optimal play: the first player can take $7$, forcing the second player to take $3$ and $4$; conversely, a second player can reply to an opening $3$ or $4$ by taking $7$, resulting in a draw. Thus \[ V(\{3,4,7\},0)=0. \] But for an acting player already behind by $2$, \begin{equation}\label{wsref-0-65-71-3a-6f-66-66-73-65-74-65-78-61-6d-70-6c-65} V(\{3,4,7\},2)=-2. \end{equation} Indeed, taking $3$ leaves $\{4,7\}$; the opponent chooses $7$ and the acting player eventually receives $4$. Taking $4$ is symmetric: the opponent takes $7$ and the player eventually receives $3$. Taking $7$ makes the opponent take both $3$ and $4$ to catch up. In every case the original acting player loses by $2$.

This offset position is reachable within a legal play on $\{1,\ldots,7\}$: \[ P_1:1,\qquad P_2:2,\qquad P_1:5,\qquad P_2:6, \] which leaves scores $(6,8)$ and $R=\{3,4,7\}$ with $P_1$ to act. This is not a counterexample to Conjecture Conjecture (Optimal-draw conjecture for consecutive integers); the prefix is not claimed to be optimal.

Warning (Invalid induction shortcut): An induction on $N$ cannot replace the remaining game by a fresh Catch-Up game merely because its remaining numbers admit an equal-sum partition. The score deficit $d$ is part of the position, and Example Example (A residual tied game need not retain its value) shows that changing $d$ changes the optimal value. Any induction must track both the remaining set and the current deficit.

Balanced completions and signed exchanges

Assume a position has current scores $a$ and $a+d$, with $d\ge0$, and the player at $a$ about to select. Set \[ r={\operatorname{sum}}(R),\qquad 2a+d+r=2H,\qquad q=H-a=\frac{r+d}{2}. \] The acting player needs $q$ points to reach $H$; the opponent needs $q-d$.

Definition (Balanced completion partition): A partition $R=A\sqcup B$ is balanced for this position when \begin{equation}\label{wsref-0-65-71-3a-62-61-6c-61-6e-63-65-64} \boxed{{\operatorname{sum}}(A)=q,\qquad{\operatorname{sum}}(B)=q-d.} \end{equation} The sets $A$ and $B$ complete the acting and nonacting players, respectively, to $H$.
Lemma (Completion-partition equivalence): A balanced completion partition exists if and only if the acting player has a half-score completion subset $A\subseteq R$.
Proof: One implication is immediate. Conversely, if ${\operatorname{sum}}(A)=H-a=q$, then its complement has sum \[ {\operatorname{sum}}(R\setminus A)=r-q =(2H-2a-d)-(H-a)=H-a-d=q-d. \] Thus $B=R\setminus A$ gives the balanced partition. ∎
Remark (Correction to an earlier proposed strengthening): Using two labelled halves is useful for describing exchanges, but Lemma Lemma (Completion-partition equivalence) shows that balanced completion is not logically stronger than the original single completion-set condition.
Lemma (Propagation under cooperation): Assume $R=A\sqcup B$ satisfies (eq:balanced). If the acting player legally completes a turn using only a subset $C\subseteq A$ with ${\operatorname{sum}}(C)=d+e$, where $e\ge0$ is the new lead, then the new remaining set $(A\setminus C)\sqcup B$ is balanced for the other player's next turn, with the halves exchanged.
Proof: After the turn, the other player is behind by $e$ and still needs $q-d$ to reach $H$. Its designated completion set is $B$, of sum $q-d$. The former acting player's remaining half has sum \[ {\operatorname{sum}}(A\setminus C)=q-(d+e)=q-d-e, \] which is precisely the former acting player's remaining distance from $H$. The asserted balanced partition follows. ∎

The essential issue is that an opponent may select numbers from both halves. The next identity records the exact repair requirement without asserting that it can always be met.

Lemma (Exact signed-exchange equation): Suppose $R=A\sqcup B$ satisfies (eq:balanced), and the acting player makes selections comprising a set $C\subseteq R$. Write \[ C_A=C\cap A,\qquad C_B=C\cap B,\qquad w={\operatorname{sum}}(C_B). \] The other player, whose score was $a+d$ and is unchanged during this turn, still needs $q-d$ points to reach $H$. Choose subsets \[ D\subseteq A\setminus C_A,\qquad E\subseteq B\setminus C_B \] and let \[ B'=\left((B\setminus C_B)\setminus E\right)\cup D. \] Then $B'$ is a completion set for the other player if and only if \begin{equation}\label{wsref-0-65-71-3a-65-78-63-68-61-6e-67-65} \boxed{{\operatorname{sum}}(D)-{\operatorname{sum}}(E)=w.} \end{equation}
Proof: Since ${\operatorname{sum}}(B)=q-d$, \[ {\operatorname{sum}}(B')=(q-d)-w-{\operatorname{sum}}(E)+{\operatorname{sum}}(D). \] This equals the required $q-d$ precisely when ${\operatorname{sum}}(D)-{\operatorname{sum}}(E)=w$. ∎
Remark (A necessary equation, not an existence theorem): The signed exchange (eq:exchange) is less restrictive than requiring a subset of $A\setminus C_A$ to sum exactly to $w$: we may also give up some elements of $B\setminus C_B$. Nevertheless, writing down the equation does not prove that a solution $(D,E)$ exists. In particular, a hypothetical move that makes the acting player's score exceed $H$ leaves the opponent unable to complete to $H$ at all.

Four-number block repairs and a proposed invariant

Lemma (Repair after one deletion in an intact block): Let $u$ be a positive integer and \[ Q=\{u,u+1,u+2,u+3\},\qquad O=\{u,u+3\},\qquad I=\{u+1,u+2\}. \] Then ${\operatorname{sum}}(O)={\operatorname{sum}}(I)=2u+3$. After deleting any one number $x\in Q$, the remaining three numbers contain a subset of sum $2u+3$.
Proof: If $x\in O$, the set $I$ survives and has sum $2u+3$. If $x\in I$, the set $O$ survives and has the same sum. ∎

This lemma motivates reorienting a block after the opponent "steals" a number. For example, if $O$ was the selected completion half and $u$ was removed, replacing the surviving $\{u+3\}$ by $I$ increases the completion-side sum by exactly $u$: \[ {\operatorname{sum}}(I)-(u+3)=(2u+3)-(u+3)=u. \] This is genuine local flexibility, but applies to an intact block before a single deletion. It says nothing by itself about repeated hits to a partially consumed block, let alone the legality of a complete catch-up move.

Lemma (Small deficit: one selection and no crossing of $H$): Suppose a position has a balanced completion partition $R=A\sqcup B$, with the acting player behind by $d\ge0$, and assume \begin{equation}\label{wsref-0-65-71-3a-73-6d-61-6c-6c} \boxed{d\le\min R.} \end{equation} Then the acting player must complete the turn in exactly one selection and cannot finish that turn with score greater than $H$. If the player reaches $H$, the game is drawn.
Proof: Every $x\in R$ satisfies $x\ge d$, so the first selection catches up or overtakes and the turn immediately ends. By (eq:balanced), any $x\in R$ lies in a subset whose sum is at most $q$: indeed $x\le{\operatorname{sum}}(A)=q$ if $x\in A$, and $x\le{\operatorname{sum}}(B)=q-d\le q$ if $x\in B$. The acting player's score becomes $a+x\le a+q=H$. Equality invokes Lemma Lemma (Reaching the half-total). ∎

The attempted induction aimed to maintain both a balanced completion partition and (eq:small) immediately after every turn of one favoured player. The opposing player would then get only one choice before the next repair. The local repair lemma makes this tempting. To complete such a programme one would also need the following sufficient move criterion.

Lemma (A sufficient small-overshoot move criterion): Suppose a player is about to select from $R$ and is behind by $e>0$. Suppose $C\subseteq R$ is nonempty, has sum ${\operatorname{sum}}(C)=e+e'$ for some $e'\ge0$, and contains a number $y>e'$. Then the player may select all elements of $C\setminus\{y\}$ in any order and $y$ last, thereby ending the turn legally with lead exactly $e'$. If moreover $R\setminus C\ne\varnothing$ and \[ e'\le\min(R\setminus C), \] then the resulting handoff satisfies the small-deficit bound.

When the players are initially tied ($e=0$), a legal turn consists of exactly one selection $y$; it leaves lead $e'=y$ and satisfies the small-deficit bound only if $R\setminus\{y\}\ne\varnothing$ and $y\le\min(R\setminus\{y\})$.

Proof: For $e>0$, just before the last selection the acting player has added \[ {\operatorname{sum}}(C)-y=e+e'-y<e. \] Because every number is positive, each earlier partial sum is also strictly below $e$. Hence no earlier selection would have ended the turn. The final choice $y$ takes the cumulative addition to $e+e'\ge e$, which ends the turn with lead $e'$. The additional inequality is exactly the desired small-deficit condition for the next player. At a tie, every positive first selection immediately creates a lead and ends the turn, so a multiple-selection turn is impossible; the separate statement follows. ∎

Remark (Corrections and limitations): An earlier formulation of the sufficient criterion implicitly required a final element $y>e'$ even when $e=0$. That would be impossible because ${\operatorname{sum}}(C)=e'$ at a tie. The tied case must be treated separately as in Lemma Lemma (A sufficient small-overshoot move criterion). More importantly, this lemma does not assert that the needed subset $C$ exists. Even if suitable blocks admit exchanges, imposing the small-deficit condition turns out to exclude essential drawing moves.

Rigorous obstruction at $N=8$

In this section, the small-deficit restriction means that a specified player must, after each of their completed turns and before a terminal outcome, leave a remaining set $R$ and score lead $\ell\ge0$ satisfying \begin{equation}\label{wsref-0-65-71-3a-41} \tag{A}\boxed{\ell\le\min R.} \end{equation} No completion-partition condition is imposed: the restriction is tested in isolation, making the negative result stronger.

Proposition (Small-deficit strategies lose for $N=8$): In Catch-Up$(\{1,\ldots,8\})$, $P_2$ has a strategy defeating every $P_1$ strategy constrained to satisfy (A) after each of her turns until the game finishes. In particular, (A) is not a valid invariant for a uniform drawing strategy.
Proof: The total is $36$, so $H=18$. At her first selection, (A) forces $P_1$ to take $1$: if she took any $x>1$, her lead $x$ would exceed the still-available minimum $1$. Player $P_2$ responds with $2$, leaving \[ (s_1,s_2)=(1,2),\qquad R=\{3,4,5,6,7,8\}. \] Player $P_1$ is behind by $1$ and therefore obtains exactly one selection $x$. Its resulting lead is $x-1$. Condition (A) allows only $x=3$ or $x=4$: all $x\ge5$ leave $3$ available and give $x-1>3$.

Case I: $P_1$ takes $3$. Player $P_2$ answers with $4$, giving \[ (s_1,s_2)=(4,6),\qquad R=\{5,6,7,8\}. \] Now $P_1$ is behind by $2$, so she must again take one number. Taking $8$ would create lead $4+8-6=6$ while leaving $5$ available, violating (A). Thus $P_1$ must take $x\in\{5,6,7\}$. Player $P_2$ responds with $8$, leaving \[ (s_1,s_2)=(4+x,14),\qquad R=\{5,6,7\}\setminus\{x\}. \] Each remaining number is at least the new deficit $10-x$ of $P_1$. So she takes one of the two remaining numbers, say $z$, and $P_2$ takes the final number $w$. Consequently, \[ s_1=4+x+z\le17, \qquad s_2=14+w\ge19. \] Thus $P_1$ loses in every permitted continuation.

Case II: $P_1$ takes $4$. Player $P_2$ responds with $5$, obtaining \[ (s_1,s_2)=(5,7),\qquad R=\{3,6,7,8\}. \] Player $P_1$, behind by $2$, must take one number. Taking $x\in\{6,7,8\}$ would give lead $x-2>3$ while leaving $3$, violating (A). Hence she must choose $3$, reaching $(8,7)$. Player $P_2$ takes $7$, reaching \[ (s_1,s_2)=(8,14),\qquad R=\{6,8\}. \] There are two legal endings:

$P_1$ takes$P_2$ takesFinal $(s_1,s_2)$
$6$$8$$(14,22)$
$8$$6$$(16,20)$
Both are losses for $P_1$. This completes the proof. ∎

The next proposition confirms that the restriction excludes a genuinely drawing continuation rather than merely some unneeded, aesthetically unpleasant choice.

Proposition (An excluded move is the only non-losing move): At the legal position \begin{equation}\label{wsref-0-65-71-3a-63-72-69-74-69-63-61-6c} \boxed{(s_1,s_2)=(4,6),\qquad R=\{5,6,7,8\}, \qquad P_1\text{ to move},} \end{equation} $P_1$ can avoid losing by taking $8$, whereas each of the choices $5,6,7$ is losing against the response $8$ by $P_2$. The drawing move $8$ violates (A), although it leaves a balanced completion partition.
Proof: The losses after selecting $5,6,$ or $7$ are established in Case I of Proposition prop:N8.

If instead $P_1$ takes $8$, the scores become $(12,6)$ and $R=\{5,6,7\}$. Player $P_2$ is behind by $6$. His complete legal turns are precisely \[ \langle6\rangle,\quad\langle7\rangle,\quad \langle5,6\rangle,\quad\langle5,7\rangle. \] For each, $P_1$ can respond as follows:

$P_2$'s turn$P_1$ next takesFinal $(s_1,s_2)$
$\langle6\rangle$$7$$(19,17)$
$\langle7\rangle$$6$$(18,18)$
$\langle5,6\rangle$$7$$(19,17)$
$\langle5,7\rangle$$6$$(18,18)$
Thus $P_1$ can force at least a draw; the second or fourth reply shows that $P_2$ can force a draw against this choice, so the move's minimax outcome is exactly a draw.

Finally, after taking $8$, $P_1$ leads by $6$, whereas the smallest remaining number is $5$. Hence (A) fails. Nevertheless, $P_1$ needs $18-12=6$ to reach $H$, and $P_2$ needs $18-6=12$; the remaining set has balanced completion partition \[ \underbrace{\{6\}}_{{\operatorname{sum}}=6} \qquad\sqcup\qquad \underbrace{\{5,7\}}_{{\operatorname{sum}}=12}. \] So balanced completion survives even though small deficit does not. ∎

Corollary (Failure of the proposed proof scheme): There is no proof of Conjecture Conjecture (Optimal-draw conjecture for consecutive integers) based on the claim that $P_1$ can always play non-losing while maintaining (A) after every turn: that claim is false already for $N=8$.
Proof: Proposition prop:N8 directly contradicts the claimed strategy. Adding a completion-partition requirement or further blockwise rules cannot restore a strategy while retaining the restriction (A). ∎

What has and has not been established

Proved results

  1. The minimax recurrence (eq:recursion) exactly encodes the one-by-one selection rule, including turn changes upon equality.
  2. Opening reversal, the criterion of two non-losing openings, and uniqueness of a strictly winning opening are valid; the opening symmetry is attributed to Bernhard von Stengel.
  3. For $N\equiv0,3\pmod4$, an explicit equal-sum partition exists and yields at least one legal drawn play.
  4. Reaching the half-total exactly forces a draw; exceeding it forces a win.
  5. The single completion-subset condition is equivalent to the balanced completion-partition condition; repair by a signed exchange is governed exactly by (eq:exchange).
  6. An intact four-number block can retain its half-block target sum after one arbitrary deletion, but this does not establish a repeated repair strategy.
  7. The combined small-deficit strategy fails, even without its partition component, by an explicit $N=8$ adversarial analysis.

Claims not established

  1. A uniform construction of two non-losing openings for ${S_N}$ whenever ${T_N}$ is even.
  2. Preservation of half-score completion sets under all legal adversarial turns.
  3. A repair-and-catch-up exchange strategy across repeatedly used four-number blocks.
  4. An induction step from $N$ to $N+4$ preserving the full game value when the residual deficit is included.
  5. Conjecture Conjecture (Optimal-draw conjecture for consecutive integers), i.e. the uniform assertion $V({S_N},0)=0$ for every $N\equiv0,3\pmod4$.
Remark (A more appropriate future direction): The example in Proposition Proposition (An excluded move is the only non-losing move) shows that a drawing strategy must sometimes permit an opponent to make multiple selections on the next turn. A plausible invariant would need to track the full residual game state, or classify safe multi-selection responses while permitting completion-set repairs. This is only a research direction; no such invariant or induction is proved here.

Notes on attribution and computational evidence

The original Catch-Up article is due to Isaksen, Ismail, Brams and Nealen (2015) [isaksen2015]. The author of the present problem attributes the opening-reversal result to Bernhard von Stengel; its inclusion above is expository rather than a priority claim. Von Stengel's conference abstract reports computational results through $N=28$ and discusses the desirability of an induction proof [vstengel2019]. The problem poser reports additional brute-force checks of the consecutive even-total case through $N=34$; those checks are not reproduced or independently verified in these notes. Finite computational verification, regardless of its range, does not substitute for a general proof.

References

Completion Estimate

10%