ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, and let a partition of size n2n^2 be a partition whose diagram contains n2n^2 cells. For such a partition, consider the game trees of Downright and LCTR played on it, and let the number of nodes in a game tree mean its total number of nodes. Square-partition conjecture. The number of nodes in the game tree of any game of Downright and LCTR on a partition of size n2n^2 is maximized by the square partition % \begin{tikzpicture}[scale=0.08]% \draw (0,0) -- (0,-3)--(1,-3)--(1,0) (0,0)--(3,0)--(3,-1)--(0,-1) (0,-2)--(3,-2)--(3,-3)--(0,-3) (2,0)--(2,-3)--(3,-3)--(3,0);% \end{tikzpicture}% _{n,n}. This conjecture proposes that the square shape gives the largest game-tree complexity among partitions of the same size; the preceding rectangular calculation motivates it, but no resolution is supplied here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.