Skip to content

Winning projects

What strong projects actually look like — the question they asked, the design that survived review, and the one decision that made the difference.

Archive entries are summaries compiled for study. Read them for how a project was structured, argued, and defended — not as a template to reproduce. Copying someone else's project is the one thing that will end yours.

2 projects in Mathematics

advanced

A bound on similar structures in 3-uniform hypergraphs

Owen Jianwen Zhang

Second place · Regeneron STS 2025

A proof establishing a maximum for how many 3-uniform hypergraphs can share a structure while differing in their connections, resolving a question that had stood open, with applications in computer science.

  • combinatorics
  • hypergraphs
  • extremal-combinatorics
  • +1
advanced

Memory and Selfishness in the Prisoners Dilemma

Cory Seelenfreund

Third place · Regeneron ISEF 2025

Simulation and mathematical modelling of how memory length and degree of self-interest change outcomes in the iterated prisoner's dilemma, framed around implications for AI agent design.

  • game-theory
  • prisoners-dilemma
  • agent-based-modelling
  • +1