Best fishing windows from tide, solunar and weather data
Exact prompt
# Fishing trip planner from tide, solunar and weather data `input.json` (synthetic) covers 48 hours, hour index h = 0..47 meaning the hour [h, h+1). It has `tide_m` (49 hourly heights at h = 0..48), `wind_kt` and `pressure_hpa` (48 values), `solunar_major` and `solunar_minor` (lists of [start, end] in fractional hours), `daylight` ([sunrise_hour, sunset_hour] for day 0 and day 1, in hour-of-day), and `window_hours` L. Write `solve.py` (Python 3 standard library only); `python solve.py input.json answer.json` writes `answer.json` and `windows.svg`. Fresh inputs are used too. ## Hourly score - If wind > 20 kt the hour is **unfishable**: score null, ignore the rest. - +3 if any major period overlaps the hour (start < h+1 and end > h); +1.5 if any minor period overlaps (both can apply). - Tide movement d = |tide[h+1] - tide[h]|: +2 if d >= 0.3, else +1 if d >= 0.15. - Wind above 10 kt (and <= 20): -1. - Pressure trend dp = pressure[h] - pressure[h-3] (0 for h < 3), rounded to 6 decimals: +1 if dp <= -1.0, -1 if dp >= +1.0. - Outside daylight: -2, where daylight means sunrise <= (h mod 24) < sunset for day h // 24. Round each score to 2 decimals. ## Windows A window starting at s covers hours s..s+L-1, all fishable; its score is the sum, rounded to 2 decimals. Sort all windows by score descending then start ascending, and greedily keep up to 3 that do not overlap any already kept one. ## answer.json `{"hourly_scores": [48 values or null], "unfishable_hours": n, "windows": [{"start", "end" (= start + L), "score"}, ...]}` ## Visual output: windows.svg Static, self-contained SVG (root `<svg>`; no `<script>`, `<img>`/`<image>`, `<link>`, `<iframe>`/`<object>`/`<embed>`, `on*` handlers, `href`/`src` except `#...` or `data:`, CSS `url(http...)`/`@import` or fetches; renders headless) with an element `id="hourly-bars"` (the hourly scores) and one `<rect id="window-N">` for each reported window N = 1, 2, 3 in answer order. The drawing itself is not graded. ## Scoring Hidden checks (partial credit; all must pass): `hourly_scores_day1` (hours 0-23), `hourly_scores_day2` (24-47 plus unfishable count), `top_windows`, `windows_svg_static` (windows.svg exists, follows the static rules, has the ids/tags above), `fresh_run_1`, `fresh_run_2`. Tolerance 0.001. 60-second limit per run.
Overlap tests on fractional periods, threshold boundaries placed exactly at 10 and 20 kt, a 3-hour pressure trend with float rounding, daylight by day index, and greedy non-overlapping window selection with ties. Original benchmark task written for usecaserank.com (not based on a specific public post). Headless, offline run on a reproducible fixture. Each run's notes say how its cost was measured (estimates are marked).
Benchmark code for comparing AI models, not navigation or safety software.
Success criteria: 1. hourly_scores_day1 2. hourly_scores_day2 3. top_windows 4. windows_svg_static 5. fresh_run_1 6. fresh_run_2
Best model for this task so far: Gemma 4 31B Instruct (Venice) (thinking on) (success, $0.0058, 2m).
Latest output per model
All runs (10)
90% pass rate across 10 eligible runs: 9 pass, 1 partial, 0 fail. Partial and failed runs are listed below with everything else.ⓘ
| Model | Cost | Time | Step-insⓘ | Autonomy | Outcome | Trustⓘ | Date | Compare |
|---|---|---|---|---|---|---|---|---|
| GGemma 4 31B Instruct (Venice)thinking on | $0.0058 | 2m | 0 | Fully autonomous | pass | Trust 80% | 2026-11-04 | |
| DDeepSeek V4.1 Flash (Venice)thinking on | $0.01 | 49s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-27 | |
| QQwen3 Coder 480B Turbo (Venice)thinking on | $0.0073 | 2m | 0 | Fully autonomous | pass | Trust 80% | 2026-10-27 | |
| GGemini 4 Argonmedium · thinking on | $0.17 | 3m | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| GGemini 3.8 Flashmedium · thinking on | $0.29 | 3m | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| OGPT-6.1 Soldefault · thinking on | $0.05 | 1m | 0 | Fully autonomous | pass | Trust 80% | 2026-10-22 | |
| MMistral Small 3.2 24B Instruct (Venice)thinking on | $0.0039 | 38s | 0 | Fully autonomous | partial | Trust 80% | 2026-10-21 | |
| AClaude Haiku 5.5default · thinking on | $0.0071 | 27s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-20 | |
| AClaude Opus 5.5default · thinking on | $0.16 | 31s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-20 | |
| AClaude Sonnet 5.5default · thinking on | $0.06 | 22s | 0 | Fully autonomous | pass | Trust 80% | 2026-10-20 |
Embed this result
A live badge for this use case. It links back here and updates as new runs are published.
Get new runs and ranking changes weekly
Which models got better or cheaper on real tasks like this one.