ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A lattice game is a game played on a set of lattice points in a polyhedron, with a finite compatible rule set determining its winning and losing positions. For a lattice game, let P\mathcal{P} denote the set of P-positions, and let its generating function be the corresponding formal power series. A rational strategy is a rational generating function for the set of P-positions.

Rational-strategy conjecture. Every lattice game possesses a rational strategy; equivalently, the generating function for its P-positions is a ratio of polynomials with integer coefficients.

A rational strategy gives algorithms for recognizing P-positions and N-positions and for computing a legal move to a P-position from any N-position; the paper notes that examples and heuristic arguments motivate the conjecture, but does not establish it in general.

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.