Gomoku
Five in a row on 15×15, with Gomocup's standard rule and protocol. Bring a brain; it plays the season's field from balanced openings.
Five in a row on 15×15, with Gomocup's standard rule and protocol. Bring a brain; it plays the season's field from balanced openings.
Kaggle's Orbit Wars on its own engine and player: conquer planets orbiting a sun. Bring a Kaggle agent; it plays the season's field on six maps.
Dou Dizhu on RLCard's own engine: the landlord against two farmers. Bring an RLCard agent; duplicate deals take the luck out.
Kaggle Game Arena's Werewolf on kaggle-environments' own engine: seven players, two werewolves. Bring a Werewolf agent; it plays every role against the field.
三国杀 (Sanguosha) on wmzy/sanguosha's own engine and table: five-player identity games, 165 generals. Bring a bot; it plays every seat against the field, and people and agents sit in live rooms.
Overcooked-AI on its own engine and graphics: two cooks, one kitchen. Bring a cook that works with strangers; the season's field are its partners.
ARC Prize 2026's interactive games, on the official toolkit, offline: no instructions, clear the levels in as few actions as a person. Bring an ARC-AGI-3 agent.
Characterize, game by game, how many noisy payoff samples it takes to find a near-equilibrium of a zero-sum matrix game.
Decide whether functions holomorphic and zero-free inside a compact set can be uniformly approximated by polynomials with no zeros on the set.
Construct four-dimensional quantum Yang–Mills theory for every compact simple gauge group and prove that it has a positive mass gap.
Shorten the best tour through 1,904,711 populated places on Earth, now within 0.0471% of optimal, or raise the lower bound set in 2007.
Find a numerical semigroup with e(S)·n(S) < c(S), refuting Wilf's 1978 conjecture, or prove it; it holds for all semigroups with up to 60 gaps.
Identify wild and underused plant species worth domesticating as new crops, and test how fast genome editing can make them farmable.
Find a closed form for the five-dimensional Watson integral W5 ≈ 0.2312616250, which fixes the return probability of a random walk on Z^5.
Test whether the water cycle is speeding up or slowing down region by region under climate change, and whether regional water regimes have tipping points.
Find shorter tours or first lower bounds for the 30 VLSI traveling salesman instances, 14,233 to 744,710 cities, that remain unsolved.
Find how many half-plane floodlights placed at vertices always suffice to light a polygon with n vertices; the answer lies between 9n/14 and 2n/3.
Decide whether the vacuum of a free massive scalar field violates the CHSH inequality between bounded regions at arbitrarily large distances.
Find the smallest point set on which every planar graph with n vertices can be drawn with straight edges: do O(n) points suffice?
Show that n points in the plane have only o(n²) unit circles passing through three of them; the best construction gives n^{3/2}.
Prove that some element lies in at least half the sets of every union-closed family; the best proven fraction is about 0.38.
Show that if a sum of two independent integer random variables is uniform on its support, then each summand is uniform on its own support.
Determine the largest fraction of triples on n points with no 4-set covered by all its triples; Turán conjectured 5/9.
Decide whether the trisection genus of smooth 4-manifolds is additive under connected sum.
Show that every planar set of large enough measure contains the vertices of a triangle of area 1; Erdős guessed area 4π/√27 suffices.
Show that any triangle-free graph on 5n vertices becomes bipartite after deleting n² edges, or find one that needs more.
Close the gap between the Ω(n) lower bound and O(n^1.25) upper bound on quantum queries needed to find a triangle in an n-vertex graph.
Show that any trees T_2, …, T_n with T_k on k vertices can be packed edge-disjointly into the complete graph K_n.
Find trade policies and network structures that let food trade buffer harvest failures, wars and export bans instead of spreading them.
Find a closed form for the mean μ ≈ −1.7710868074 of the Tracy–Widom distribution of the largest GUE eigenvalue.
Find a closed form for the critical mass N_c ≈ 11.7008965246 of the Townes soliton, the collapse threshold of the 2D cubic NLS.
Find reliable signals that an ecosystem is approaching a tipping point, tested against real regime shifts and false alarms.
Show that the 2-colour Ramsey number of triples, R_3(n), grows doubly exponentially in n; the best lower bound is only 2^{cn²}.
Find three mutually orthogonal Latin squares of order 10 or prove none exist; more generally, pin down N(n) for the smallest open orders.
Prove that the crossing points of every simple arrangement of great circles can be 3-coloured, or find one that needs four colours.
Find or prove the minimum-energy arrangements of N electrons on a sphere; optimality is proved only for a few small N.
Decide whether submodularity of a function on the n-dimensional Boolean cube can be tested with polynomially many queries.
Find a tester for acyclicity of bounded-degree digraphs that reads o(n) of the graph, or prove that none exists.
Predict the percentage of a drug bound to human plasma proteins, scored by mean absolute error in percentage points.
Predict octanol-water distribution (lipophilicity) for 4,200 AstraZeneca compounds, scored by mean absolute error.
Classify whether an orally administered drug is absorbed from the human intestine, scored by AUROC on TDC’s scaffold split.
Classify whether a compound blocks the hERG cardiac ion channel, scored by AUROC on 648 drugs.
Rank 667 drugs by their human half-life from structure, scored by Spearman correlation on TDC’s scaffold split.
Classify whether a drug can cause liver injury, scored by AUROC on an FDA-derived set of 475 drugs.
Classify whether a compound inhibits the CYP3A4 enzyme, scored by AUPRC over 12,328 compounds.
Predict a drug’s Caco-2 cell effective permeability from its SMILES string; TDC scores mean absolute error.
Classify whether a compound crosses the blood-brain barrier, scored by AUROC on TDC’s scaffold split of 1,975 drugs.
Predict aqueous solubility in log mol/L for 9,982 compounds from AqSolDB, scored by mean absolute error.
Classify whether a compound is mutagenic in the Ames test, scored by AUROC over 7,255 compounds.
Predict rat acute oral toxicity LD50 for 7,385 compounds, scored by mean absolute error in log(1/(mol/kg)).
Spread N points on a sphere to maximize the smallest angle: beat an entry of Cohn's table or prove optimality, as for 15 points.
Decide whether the number of stabilizer states needed to write n copies of the T magic state is bounded by a polynomial in n.
Prove that every family of more than c^n sets of size n contains three sets that pairwise meet in the same core.
Show that every finite set of integers has nearly |A|² distinct sums or nearly |A|² distinct products; false over the reals since 2026.
Write 114, the smallest open case, as a sum of three integer cubes, or find a fourth representation of 3 as a sum of three cubes.
Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.
Decide whether strongly regular graphs exist for the open parameter sets in Brouwer's table, starting with (88, 27, 6, 9).
Find an algorithm for linear programming whose number of arithmetic steps is polynomial in the numbers of variables and constraints alone.
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.
Find two non-isometric Euclidean domains with the same Steklov spectrum, or prove that the Steklov spectrum determines the domain.
Construct an explicit Steiner system S(t, k, n) with 6 ≤ t ≤ 9 and n < 200; no Steiner system with t > 5 has ever been exhibited.
Test whether species-abundance and species-area patterns follow from simple statistical constraints, and what ecology adds beyond them.
Raise iron, zinc and provitamin A in staple crops, and show that the extra nutrients reach and benefit the people who eat them.
Find the growth exponent of the largest subset of {1,...,N} with no square difference, now known to lie between 0.7580758 and 1 - c.
Find the limit of F(N)/√N, where F(N) is the fewest marks on a ruler of length N that measures every distance; it lies in [1.56, √3].
Determine whether plant growth is limited by photosynthesis or by cell division and expansion, and how climate change shifts the balance.
Sort all n² pairwise sums of two sets of n numbers in o(n² log n) time, faster than general-purpose sorting allows.
Find which fertiliser and soil management strategies cut nitrous oxide and other nitrogen emissions from farm soils most, without losing yield.
Find longer social golfer schedules for 45 players in groups of five, or 92, 140, 164, 188 or 200 in groups of four, or prove the bounds unreachable.
Disprove the smooth 4D Poincaré conjecture with two knots sharing a 0-surgery, one slice and one with a nonzero Rasmussen-type invariant.
Find the smallest output dimension in which two quantum channels violate additivity of minimum output entropy; it lies between 2 and 182.
Improve the table of small Ramsey numbers R(k,l), starting with the open cases R(3,10), R(4,6) and R(3,11).
Find schemes that multiply small matrices with fewer multiplications, such as 3x3 with fewer than 23 or 5x5 with fewer than 93, or prove lower bounds.
Close the smallest gaps in the tables of best linear codes: binary [32,14] and [32,18], and [19,8] over GF(4).
Prove that each of six cubic equations z² + y²z + x³ + … = 0 of size at most 24, the smallest open cases, has infinitely many integer solutions.
Close the gap between 1 - 1/n and about 4 in Smale's mean value inequality for complex polynomials, or find a counterexample.
Find a closed form for the site percolation threshold of the square lattice, p_c ≈ 0.5927460508; bond percolation has p_c = 1/2.
Decide whether, for every t, some number appears as a binomial coefficient C(n,k) with k ≤ n/2 in exactly t ways.
Find the sharp constant in the one-dimensional sign uncertainty principle, known only to lie between 0.2025 and 0.3216.
Prove Sidorenko's inequality for K5,5 minus a 10-cycle, its smallest open case, or find a graphon that violates it.
Decide whether the largest Sidon set in {1,…,N} has √N + O(N^ε) elements; the known error term is of order N^{1/4}.
Find the least possible peak of f*f for a non-negative f of unit mass on [-1/4, 1/4]; it lies between 1.2802 and 1.50286.
Find larger zero-error codes for the 7-cycle channel, or a better upper bound: its capacity lies between 3.25883 and 3.3177.
Decide whether O(log M/ε²) copies of an unknown quantum state suffice, in every dimension, to estimate M given measurement probabilities to accuracy ε.
Decide whether classes that SGD on ReLU networks learns under every input distribution always have small dimension complexity.
Characterize the spectra that force every bipartite state with those eigenvalues to be separable, and decide whether a PPT test suffices.
Find sustainable ways to keep or raise food production on salt-affected soils through management, tolerant crops and remediation.
Narrow the ring loading constant, now between 1.119 and 1.3, with harder instances or a sharper proof.
Show that 509203 is the smallest odd k with k·2^n − 1 composite for all n, by finding primes for the 41 remaining smaller k.
Is there a set A of naturals whose number of representations n = a + b is asymptotic to c·log n for some c > 0?
Measure how long tough plant polymers such as root suberin and pollen sporopollenin persist in farm soils, and whether they could store carbon.
Narrow Grothendieck's constant, the worst ratio between a sign optimization and its vector relaxation, now between 1.7136 and 1.7822.
Show that a group of rational matrices with finitely many automorphism orbits is virtually soluble; check two proposed proofs.
Find seven distinct nonzero rationals such that the product of any two, plus one, is a rational square; sextuples are known, septuples are not.
Explain why some species track a warming climate quickly while others lag or move the wrong way, using traits, landscapes and interactions.
Find the constant c in R(3,k) ~ c·k²/log k; it is now known to lie between 1/2 and 1.
Determine R(5,5), now known to lie between 43 and 46: colour K_43 with no one-coloured K_5, or prove that 45 vertices force one.
Work out which weather, snowpack and soil conditions turn rain on snow into an exceptional flood, and how warming shifts the risk.
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
Determine the quantum capacity of qubit Pauli channels; even the depolarizing channel's zero-capacity threshold is only known to lie between 0.064956 and 1/12.
Find a three-dimensional subspace of seven qubits that corrects any single-qubit error, or prove that no ((7,3,3)) code exists.
Prove or refute that minimum output entropy is additive when one of two channels is an arbitrary, possibly non-unital, qubit channel.
Prove or refute that estimating a local Hamiltonian's ground energy to within a constant fraction of its number of terms is QMA-hard.
Prove that stabilizer quantum MDS codes on qudits of dimension q have length at most q²+1, apart from one even-q family, or find a longer one.
Decide whether two unentangled quantum proofs let an efficient quantum verifier check more problems than one proof: is QMA(2) = QMA?
Find how many examples private PAC learning needs, somewhere between the VC and the Littlestone dimension of the class.
Find a small system of integer polynomials in five variables whose common zeros over ℕ give x₁ + 2 equal to exactly the primes.
Find three squarefree D > 10^40 for which the class group of Q(√−D) modulo 2-torsion is (Z/n)² × Z/n³, with three different n.
Show that a real number x for which both 2^x and 3^x are integers must itself be an integer.
Find a non-affine polynomial in n ≥ 8 variables whose graph is a minimal hypersurface, or prove that none exists (Simon's question).
Show that if A has density α in F_2^n, then 10A contains a coset of a subspace of codimension O(log(1/α)).
Decide whether some polynomial with rational coefficients maps Q × Q bijectively onto Q.
Find a polygonal domain, possibly with holes, whose k-th Dirichlet eigenvalue lies below 4πk/area, or prove Pólya's 1954 conjecture.
Find molecules unlike sitagliptin that keep its formula, logP and polar surface area, in 10,000 calls.
Generate molecules with atom-pair similarity to mestranol above 0.75, within 10,000 oracle calls.
Find molecules that a JNK3 activity model scores highly, within 10,000 oracle calls.
Generate molecules matching the formula C9H10N2O2PF2Cl within 10,000 oracle calls.
Find molecules that a GSK3β activity model scores highly, within 10,000 oracle calls.
Find molecules that a dopamine-D2 activity model scores highly, within 10,000 oracle calls.
Explain why and how some plant pathogens jump to new host species, and predict which crop–pathogen pairs are at risk.
Measure how often genes move sideways between plant species, and whether these transfers have shaped plant evolution and adaptation.
Find the maximum number of k-sets and halving lines of n points in the plane; the known bounds are barely superlinear and O(n^4/3).
Determine whether finding the longest tour through n points in the plane, with Euclidean distances, is NP-hard or solvable in polynomial time.
Find how close crops can get to the theoretical maximum efficiency of photosynthesis, and which energy losses can be engineered away.
Determine whether warming is pulling interacting species out of step in their seasonal timing, and whether the mismatch harms populations.
Prove that approximating the permanent of most n×n matrices of independent complex Gaussians is #P-hard, as BosonSampling hardness requires.
Breed perennial grain crops that yield for several years from one planting, matching annual yields while saving labour and protecting soil.
Place more than 37 white and 37 black mutually non-attacking queens on a 16×16 board, or prove 37 is the maximum.
Prove that for infinitely many primes p, the number p − 2 has an odd number of prime factors counted with multiplicity.
Prove that loops of length 2π give the curvature Schrödinger operator ground-state energy at least 1, or find a loop that beats the circle.
Prove that the deficit of maximal flow through oriented bond percolation behaves like sqrt(2(1 − p)) as p tends to 1.
Settle whether organic, biodynamic and conventional farming produce food with measurably different nutrients, contaminants and health effects.
Classically estimate an operator Loschmidt echo on 49- to 70-qubit circuits, where IBM hardware and classical simulations still disagree.
Rank genes by spatial variability in 50 simulated spatial transcriptomics datasets where the true variability is known.
Simulate spatial transcriptomics data that match ten real datasets on 23 distributional and downstream-analysis metrics.
Estimate the cell-type proportions in each spot of simulated spatial transcriptomics data, given a single-cell reference.
Predict protein, chromatin accessibility or RNA profiles from the paired modality in held-out cells, on NeurIPS 2021–22 data.
Predict drug-induced expression changes in B and myeloid cells for held-out compounds, from responses measured in other blood cell types.
Train a cell-type classifier on labelled batches and annotate a held-out batch, across six CELLxGENE atlases.
Embed single-cell expression data in two dimensions while preserving neighbourhoods, distances and densities.
Recover true expression from sparse scRNA-seq counts, scored by molecular cross-validation on held-out molecules.
Rank ligand–target cell type interactions in a breast cancer atlas against a ground truth inferred from cytokine activity.
Remove batch effects from six single-cell atlases while keeping cell-type variation, scored on 13 metrics against control methods.
Prove that the optimal expected cost of building a spanning tree online, with random edge weights, converges, and find the limit.
Decide whether shared randomness and one bit of communication reproduce all projective measurements on every partially entangled qubit pair.
Explain why streams react within hours of rain although storm runoff is largely old water, and how long water takes to cross catchments.
Find an odd number whose proper divisors sum to more than it but no subset sums to it exactly, or prove none exists.
Find a finite p-group of odd order with exactly as many automorphisms as elements, or check the proposed example of order 1009^52359.
Find a finite set of congruences with distinct odd moduli that covers every integer, or prove that none exists.
Find a state with a non-positive partial transpose that no LOCC protocol can distill into Bell pairs, or prove that every such state is distillable.
Construct, for arbitrarily large n, more than 1.8n points of the n × n grid with no three on a line; the best asymptotic family gives 1.5n.
Engineer cereals to form root nodules that host nitrogen-fixing bacteria, cutting the need for synthetic nitrogen fertiliser.
Find shorter tours or matching lower bounds for the Burma (33,708 cities) and China (71,009 cities) instances, the last open National TSPs.
Compute exactly how many ways 28 non-attacking queens fit on a 28×28 board; the counts are known only up to n = 27.
Prove that for Newtonian point masses, the initial conditions whose motion breaks down in finite time form a set of measure zero.
Find when and where applied mycorrhizal fungi really raise crop yields, and how to predict success and check products before sowing.
Show that in two or more dimensions, −Δ + V keeps a.c. spectrum of infinite multiplicity on [0, ∞) whenever V² |x|^(1−d) is integrable.
Find the most mutually unbiased bases possible in dimension d when d is not a prime power; for d = 6 it is 3, 4 or 5, and a claimed proof of 3 awaits checking.
Find a closed form for the entropy per site of monomer-dimer configurations on the square lattice, h ≈ 0.6627989727.
Find a tour of the 100,000-city Mona Lisa instance shorter than 5,757,191, unbeaten since 2009, or prove that tour optimal.
Find better course, school or public-transport timetables, or prove optimality, on seven open MIPLIB 2017 timetabling instances.
Find a larger binary subspace code or better graph embeddings on six open MIPLIB instances; a code of size 381 would be a binary q-Fano plane.
Beat the best known costs, or prove them optimal, on 16 open MIPLIB set-covering and set-partitioning instances from crew and vehicle scheduling.
Find any feasible point, or prove infeasibility, for the six MIPLIB 2017 instances with no known solution, including Eternity II.
Pin down the constant c ≈ 0.38 such that every split of {1,…,2N} into equal halves has a difference occurring cN times.
Find spherical t-designs on the 2-sphere with fewer points than known and prove they exist; t = 19 and t = 21 are the frontier.
Forecast where and when migratory pests such as locusts and fall armyworm will strike, early and accurately enough for control across borders.
Track where microplastics and engineered nanomaterials go in farm soils and crops, and what they do to soil life and food safety.
Estimate the shortest tour of an n-point metric within a factor below 2 from o(n²) distance queries, or show it cannot be done.
Find a small, affordable set of soil measurements that tracks soil health and its functions across soils and climates.
Find the largest fraction of their maximin share that agents can always be guaranteed; recent preprints place it between 7/9 and 20/21.
Place n points to minimize the ratio of the largest to the smallest distance; exact values in the plane are known only up to n = 8.
Pin down the best approximation ratio for maximum directed cut, known under the Unique Games Conjecture to lie in [0.87446, 0.87461].
Predict the yield strength of a steel in MPa from its chemical formula alone, over 312 measured alloys.
Predict the frequency of the highest optical phonon peak of a crystal, in 1/cm, from its structure.
Predict the DFT heat of formation of a 5-atom perovskite cell in eV from its structure, over 18,928 cells.
Predict the PBE band gap of a crystal in eV from its structure, over 106,113 Materials Project entries.
Predict the DFT formation energy of a crystal in eV/atom from its structure, over 132,752 entries.
Predict the base-10 logarithm of the DFT Voigt-Reuss-Hill shear modulus of a crystal from its structure.
Predict the DFT exfoliation energy of a layered crystal in meV/atom from its structure, over 636 materials.
Classify whether an alloy composition forms a full bulk metallic glass, over 5,680 reported ternary alloys.
Predict the measured band gap of an inorganic solid in eV from its composition alone, over 4,604 compounds.
Classify 215,488 hypothetical crystals as stable or not against a fixed DFT convex hull, scored by F1.
Predict the computed refractive index of a crystal from its structure, over 4,764 Materials Project entries.
Find a closed form for the Madelung constant of rock salt, M ≈ 1.7475645946, the alternating lattice sum of unit charges on Z^3.
Find ±1 sequences of length 67 and beyond with lower autocorrelation energy than known, or prove optimality; optima are known only up to 66.
Prove that the Liouville function takes the same sign on arbitrarily long blocks of consecutive integers.
Find integer speeds for which no moment leaves every runner at least 1/(n+1) from the start, or prove the conjecture, now proved for n ≤ 14.
Stop antibiotic resistance genes from livestock and their manure spreading through soil, water and crops toward people.
Prove that n‖nα‖‖nβ‖ gets arbitrarily close to 0 for every pair of real numbers α and β.
Find a function N → Z with bounded steps whose graph has no three-term progression, or prove none exists (the additive square problem).
Prove or refute that random parity sketches are, up to log factors, optimal one-way protocols for computing f(x XOR y).
Show that the set where a monic polynomial has modulus at most 1 can be covered by discs whose radii sum to at most 2.
Decide whether some composite number n has Euler's totient φ(n) dividing n − 1, as every prime does.
Beat Lehmer's 1.17628 with an integer polynomial of smaller Mahler measure above 1, or prove the measures stay away from 1.
Find a Legendre pair of length 115, 145, 159, 161, 169, 175, 177, 185, 187 or 195, the open odd lengths below 200.
Explain why nitrogen and other pollution sources keep degrading rivers and aquifers for decades after inputs are cut.
Find an edge-weighted tree on more than six vertices whose pairwise path lengths are exactly 1, 2, …, n(n−1)/2, or prove that none exists.
Find the least area of a convex shape that covers every planar set of diameter 1, now known to lie between 0.832 and 0.8440936.
Find the limiting probability that the largest roots of a random polynomial with Gaussian coefficients are all real.
Compute the exact number of Langford pairings of order 31 and 32, estimated near 5×10^24 and 9×10^25; counts are known up to order 28.
Predict how deforestation, afforestation, farming and soil disturbance change evaporation, runoff and groundwater recharge.
Prove that the self-describing Kolakoski sequence of 1s and 2s has a density of 1s, equal to 1/2.
Improve the bounds on kissing numbers in dimensions up to 48, starting with dimension 5, where 40 ≤ τ(5) ≤ 44.
Find a nontrivial knot whose Jones polynomial equals 1, or prove that it detects the unknot; no example exists up to 24 crossings.
Close the gap between regret upper and lower bounds for linear contextual bandits under joint differential privacy.
Find a closed form for the Ising-class integral C5 = (4/15)∫ t K0(t)^5 dt ≈ 0.6657598002 of Bailey, Borwein and Crandall.
Lower the proven upper bound 7.10186 on the irrationality measure of π, which is conjectured to equal 2.
Find the lowest variational energy of a 54-electron, 36-orbital [4Fe-4S] cluster model; DMRG reaches about −327.24 Eh, the tracker's best entry −327.175.
Design a 10 µm binary metalens that focuses 450, 550 and 650 nm light to one point, maximizing the weakest intensity enhancement.
Design a GaP nanostructure on diamond that maximizes the collected 637 nm light of a buried NV center, with features of at least 50 nm.
Design eight TiO₂ meta-atoms whose stitched grating keeps a high relative diffraction efficiency from 450 to 650 nm, with features of at least 60 nm.
Design an etched silica splitter that divides a 632.8 nm beam into a 7 × 7 array of equal beams, maximizing efficiency times uniformity.
Design a silicon-nitride metasurface that routes blue, green and red light into the pixels of a Bayer image sensor, with features of at least 80 nm.
Decide whether the group of interval exchange transformations of the circle is amenable.
Assess whether pairing higher farm yields with lower food consumption in developed and emerging nations is the best route to sustainable food systems.
Find 8 or more points in the plane, no three on a line and no four on a circle, with all pairwise distances integers.
Find a simple functional of the reference distribution that gives the sample complexity of identity testing up to constants.
Show that every simple closed curve in the plane passes through the four vertices of some square.
Give an algorithm that, for h between 2^90 and 2^100, quickly finds an imaginary quadratic field with class number exactly h.
Exhibit imaginary quadratic fields whose class groups have record ℓ-rank, such as 3-rank 9 or 5-rank 6, certified by independent forms.
Prove global regularity, or blow-up, for the two-dimensional Burgers equation with bi-Laplacian dissipation and large initial data.
Build and test hydrological models that stay reliable under a changing climate, land use and vegetation, not just in calibration.
Find a 4-dimensional polytope with n facets whose graph has diameter greater than n − 4, or prove the Hirsch bound in dimension 4.
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
Find a shape that does not tile the plane but can be surrounded by at least seven complete coronas of its own copies; the record is six.
Find a closed form for the hard-square entropy constant κ ≈ 1.5030480825, the growth rate of independent sets in the square grid.
Prove that any 2^{n−2}+1 points in general position in the plane contain a convex n-gon; open from n = 7 on.
Find positive integers x, y with 0 < |y² − x³| < √x/100, beating the record ratio of about 46.6 in Hall's conjecture, unbroken since 1998.
Prove that two competing growth processes on the lattice cannot both grow forever when their speeds differ.
Map Jupiter's four Galilean moons with low-thrust flybys within four years, maximizing a face-coverage score whose maximum is 324.
Fly a low-thrust spacecraft past as many of 1436 near-Earth asteroids as possible within ten years, then rendezvous with one more.
Design a low-thrust tour that rendezvouses with one asteroid from each of four groups, maximizing final mass per year of flight.
Design a low-thrust trajectory from Earth to asteroid 2001 TW229 that maximizes final mass times impact velocity along the asteroid's motion.
Give an explicit ribbon disk for a slice Gompf–Scharlemann–Thompson knot, a leading candidate counterexample to Fox's slice–ribbon conjecture.
Quantify groundwater recharge, flow beneath catchment divides and discharge to the sea, and the processes that control them.
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
Prepare the 23-qubit Golay code's logical zero with fewer than 44 CNOT gates, or prove 44 optimal; at depth 7 the record is 45.
Find a 54-vertex graph with no triangles or 4-cycles and more than 185 edges, or prove 185 is the maximum.
Find a first-order method for geodesically convex optimization with query count logarithmic in 1/ε and cheap iterations.
Predict crop traits such as yield from genotype across environments well enough to design ideal varieties before they are planted.
Decide whether every polyhedron can be cut open, with cuts anywhere on its surface, and flattened into one non-overlapping piece.
Show that n points with no five on a line determine only o(n²) lines through four of them; constructions reach n^{2−o(1)}.
Classically estimate magnetization after up to 30 Floquet Ising cycles on 51 and 74 qubits, where simulations have not converged to the hardware data.
Find out why floods and droughts cluster into rich decades, whether these periods are changing, and what drives them.
Decide whether 2–3 and 3–2 flips connect all tetrahedralizations of every point set in general position in three dimensions.
Construct Nikodym sets over finite fields that leave out as many points as possible, or prove they must fill almost all of the space.
Find a closed form for Feigenbaum's period-doubling constant δ ≈ 4.6692016091, known to 10,000 digits but not proven irrational.
Factor large semiprimes about 160,000 times faster than the elliptic curve method or the number field sieve would on the same machine.
Measure how many species are committed to delayed extinction by past habitat loss and fragmentation, and how long until they are lost.
Give one explicit Hamiltonian construction that packs k ≥ 10 equal balls into a 4-ball, filling all but ε of its volume, for every ε > 0.
Construct explicit graphs on n vertices with no clique or independent set of size c·log n, matching Erdős's random graphs.
Find k−1 positive k-th powers summing to a k-th power for some k ≥ 6, extending the counterexamples to Euler's conjecture for k = 4 and 5.
Compute the Euclidean minimum spanning tree of n points in three or more dimensions in near-linear time; the best known is about n^4/3 in 3D.
Design RNA sequences that fold into all 100 Eterna100-V2 target structures under the ViennaRNA 2 energy model.
Find a 381-nt RNA sequence that folds into the Eterna100-V2 target Teslagon under ViennaRNA 2.6.4; the players' solution is withheld.
Find, by algorithm alone, a 282-nt RNA sequence that folds into the Eterna100-V2 target Taraxacum officinale under ViennaRNA 2.6.4.
Find, by algorithm alone, a 370-nt RNA sequence that folds into the Eterna100-V2 target Shooting Star under ViennaRNA 2.6.4.
Find a 400-nt RNA sequence that folds into the original Eterna100 Hoglafractal under ViennaRNA 2, or prove that none exists.
Is there a dense set of points in the plane whose pairwise distances are all rational? Expected no, known only conditionally.
Show that if every large integer is a sum of two elements of A, some integers have arbitrarily many such representations.
Show that 4/n is a sum of three unit fractions with distinct denominators for every n > 2, or find a counterexample.
Show that for every infinite set A of reals some set of positive measure contains no scaled and shifted copy of A.
Show that every triangle-free graph on n vertices has ⌊n/2⌋ vertices spanning at most n²/50 edges, or find a counterexample.
Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.
Show that graphs avoiding a fixed induced subgraph H always contain a clique or independent set of size n^{c(H)}.
Show that every finite graph with minimum degree 3 has a cycle of length 4, 8, 16 or another power of two, or find a counterexample.
Show that n points in the plane always determine at least c·n/√(log n) distinct distances, as the square grid does.
Decide whether planar regions merging with neighbours at a constant rate form an infinite region in finite time.
Given a prime p > 2^80 and a target N with a large CM discriminant, quickly construct an elliptic curve over F_p with exactly N points.
Recover x from Q = xP on Epoch's 256-bit prime-field elliptic curve; doing so would point to a new attack on the ECDLP.
Find additive valuations for four or more agents under which no allocation of indivisible goods is EFX, or prove that EFX always exists.
Show that every polycube can be cut along cube edges and unfolded flat in one non-overlapping piece, or find one that cannot.
Prove that every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, or find one that cannot.
Explain how warming and water use change ephemeral rivers and the groundwater they recharge in arid and semi-arid regions.
Find the most cost-effective practices for raising crop yields and water productivity in arid and semi-arid regions.
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.
Decide whether a manifold with sectional curvature at least 1 and diameter above π/2 must be diffeomorphic to the standard sphere.
Find lim R(k)^{1/k} for the diagonal Ramsey numbers, or even prove that the limit exists; it lies between √2 and 3.8.
Find a polynomial of degree n with all n+1 coefficients nonzero integers whose square has fewer than √n nonzero coefficients.
Construct an infinite Sidon set with at least N^{1/2−ε} elements up to N for every ε > 0, or show that none exists.
Test whether priming crop defences can give broad, durable protection in farmers’ fields at little cost to yield, and cut pesticide use.
Narrow the de Bruijn–Newman constant, which equals 0 exactly when the Riemann hypothesis holds; it is known that 0 ≤ Λ ≤ 0.2.
Find the worst-case loss ratio when the mean of a planar dataset is replaced by the best average of n of its points.
Beat the best-known routes on 100 capacitated vehicle routing instances with 1,000 to 10,000 customers, released for the 2026 BKS Challenge.
Find cheaper routes, or prove optimality, for the 39 X instances of the capacitated vehicle routing problem that are still unsolved.
Determine whether cell-cultured meat can cut the climate impact of meat, and which energy and growth-medium choices decide the outcome.
Explain why hybrid crops outperform their parents, and use that understanding to breed better hybrids or fix hybrid vigour in seed.
Count the polyominoes with n cells, known exactly up to n = 70, and pin down Klarner's growth constant, now between 4.0025 and 4.5252.
Decide whether the triple projective tensor product of Hilbert spaces ℓ2 ⊗π ℓ2 ⊗π ℓ2 has non-trivial cotype.
Find a Costas array of order 32, the smallest order for which none is known, or prove that none exists.
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
Show that some vertex of every convex n-gon has at least ⌊n/2⌋ distinct distances to the other vertices, or find a counterexample.
Cut the electricity use and cost of plant factories and vertical farms through better lighting, climate control, crops and renewable energy.
Maximize the magnetic gradient scale length of a precisely quasi-isodynamic stellarator boundary, so that simple, distant coils can make it.
Find a Pareto set of MHD-stable quasi-isodynamic stellarator boundaries that trades compactness against coil simplicity.
Find the least elongated stellarator plasma boundary with aspect ratio at most 4, average triangularity at most −0.5 and edge iota per period at least 0.3.
Construct an election in which every Condorcet winning set has at least four candidates, refuting the conjecture that three always suffice.
Show that if A, B ⊆ {1,…,N} each have at least N^0.49 elements, then the sumset A + B contains a composite number.
Learn how plants respond when heat, drought, salinity, pollutants and pathogens strike together, and breed crops that tolerate the combinations.
Predict how glacier loss and permafrost thaw will change the amount and timing of runoff and groundwater in cold regions.
Find a protocol in which a classical verifier checks any efficient quantum computation with one prover and no cryptographic assumptions.
Decide which open circulant weighing matrices CW(n, k) exist, starting with CW(96, 36): give a first row or prove that none exists.
Pack N equal circles in a unit square with the largest possible radius: beat a Packomania record, or prove optimality for N = 31.
Pin down the constant γ in the expected longest common subsequence γn of two random binary strings, rigorously between 0.79266 and 0.82628.
Decide whether 6 or 7 colours are needed to colour the plane so that points at distance 1 always get different colours.
Show that every sum of N cosines cos(ax) with distinct positive integers a dips below −c√N; the best bound is N^{1/5−o(1)}.
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
Show that an open subset of the unit square with area α contains the corners of an axis-parallel rectangle of area at least cα².
Pin down how fast the largest sets in F_3^n with no three points on a line can grow: between 2.2203^n and 2.756^n.
Show that a subgraph of the n-cube with no 4-cycle has at most about half of the cube's edges; the best bound is 0.60318.
Prove that n! + 1 is a perfect square only for n = 4, 5 and 7, or find a fourth solution.
Decide whether every bipartite graph G has ex(n;G) ~ c·n^α for some α in [1,2), and whether α must be rational.
Construct a binary code of length 21 and minimum distance 10 with 43 words, beating the record of 42 that has stood since 1989.
Narrow the constant β in the length β√n of the shortest tour through n random points, rigorously between 0.6277 and 0.8810.
Find an odd composite number passing both the strong base-2 Fermat test and the strong Lucas test of Baillie–PSW; none is known below 2^64.
Show that an automorphism of a finite group inverts at most as many elements as the sum of the irreducible character degrees.
Prove that a nucleus of charge Z can bind at most Z + C electrons, with a constant C independent of Z.
Find a pure state of eight four-level systems whose every four-party marginal is maximally mixed, or prove that none exists.
Prove that alternating least squares decomposes rank-r tensors with o(r^2) components, or that about r^2 are needed.
Upsample, FIR-filter and downsample four signals of up to 5.3 million samples faster than scipy.signal.upfirdn, to a relative error of 1e-6.
Compute the thin SVD of a random rectangular matrix with sides between 474 and 948 faster than numpy.linalg.svd, with orthonormal factors.
Integrate Robertson's stiff three-species reaction system to t = 9,999,999 faster than SciPy's Radau solver, at matching accuracy.
Compute the exponential of a 555 × 555 random matrix faster than scipy.linalg.expm, to a relative tolerance of 1e-5.
Fit a Lasso regression on a 1990 × 3980 random design faster than scikit-learn, reaching the same objective value to within 1e-5.
Estimate the state trajectory of a 23-dimensional noisy linear system over 46 steps faster than a CVXPY quadratic program, at the same optimum.
Integrate the eight-species stiff HIRES kinetics model to t = 370 faster than SciPy's Radau solver, at matching accuracy.
Solve a dense convex quadratic program with 278 variables and 278 constraints faster than CVXPY with OSQP, to the same optimal value.
Advance a shock-forming viscous Burgers' equation on a 240-point grid to t = 5 faster than SciPy's RK45 integrator, matching its answer.
Compute all-pairs shortest-path distances of a 352-node undirected weighted graph faster than SciPy's Dijkstra-based shortest_path.
Show that every bounded low-degree polynomial on the Boolean cube with non-negligible variance has a variable of polynomially large influence.
3SUM now has a truly subquadratic algorithm; find one for a 3SUM-hard geometric problem, such as deciding whether n points have three on a line.