AI GamingFinalistGPT & Claude

ProofPlay

ProofPlay is for PC racing players who want to improve their lap times but cannot identify which braking or throttle decisions are costing them time. Existing statistics show where they were slow, while coaching advice often recommends changes without checking whether they actually help. ProofPlay replays the recorded race, tests alternative inputs in the game’s own physics, and shows only changes that saved time without crashing. Players receive specific corner-level fixes and a next-race plan whose combined effect has also been tested.

Preliminary score

84.5/ 100Strongaverage of 2 judges
  • Value for the user21.5 / 25

    A specific problem and a clear outcome from solving it.

  • Prototype and use of AI24.0 / 30

    A working core scenario, and what AI actually contributes to the result.

  • Quality testing18.5 / 20

    Tests, examples of failures, and comparison with the current approach.

  • Feasibility11.5 / 15

    Data requirements, running costs and a clear next step.

  • Originality9.0 / 10

    A meaningful difference from common solutions.

A finalist: the live jury scored it 66.0 / 100 on stage.

What the judges wrote

  • Claude Opus 5.5Preliminary83/100
    Strengths
    Your core idea of showing only advice that has been re-simulated in the game's own physics is distinctive and well executed. It is backed by deterministic replay with end-state hashing, 11-variant what-if search per corner, and robustness windows. Your benchmark against a rule-based coach and GPT-5 mini on 14 races (31/31 vs 76.5% vs 37.5%) is a real comparison with how coaching is done today. You honestly frame the 100% result as a product of filtering rather than a guarantee. Documenting failures, such as combined fixes making a lap 0.69 s slower or crashing, and the open-loop drift that led you to one-lap plans, is exactly the kind of evidence that builds trust.
    To improve
    Your benchmark relies mostly on bots with planted mistakes. Running even a small study where human players follow the fixes, and measuring their real lap-time change, would show whether proven-in-simulation translates to proven-for-humans. The AI contribution is search and optimisation over physics rather than learned models, so explain clearly why this counts as intelligence and where it beats a brute-force sweep. Feasibility is tied to your own deterministic game. Spell out a realistic path to other titles (for example, games with deterministic replays or telemetry APIs) and who would pay for it.
  • GPT-6 AstraPreliminary86/100
    Strengths
    Your physics-based search produces actionable corner-level changes, while robustness windows and combined-plan replay address real ways individual tips can fail. Your three-coach benchmark, ten tamper cases and explicit slower/crashing combinations provide unusually specific testing evidence for a hackathon submission. Your API-free, headless analysis also has concrete latency and memory measurements.
    To improve
    Your next benchmark should use held-out human races, report how often no advice is returned, and measure actual next-race gains rather than only gains in the filtering simulator. Your leaderboard claim should distinguish replay consistency from authentic play: test an attacker who regenerates both the session and its hash, rather than only editing individual fields. Your deployment plan should name a target CPU, a per-race compute budget and a concrete human-pilot milestone.

The team

  • Omar Musazade

    product

  • Sanan Hajiyev

    developer

  • Rufat DostaliyevLead

    data

  • Farrukh Mammadli

    data

  • Ravan Khanbabayev

    business