Change the wording, keep your experiment. Saved in this browser when storage is available.
Compare an AI-assisted routing change
Help a rover
search less.
Change the ground. Can the upgrade examine fewer squares without a costlier route? Compare both on your map.Paint a landscape. Watch two programs find their way home. Can the upgrade examine fewer squares without taking a more expensive route?
Paint the landscape
Paint with larger controls
Choose a row and column, then apply the selected terrain brush. The highlighted square shows your selection.
Row 1, column 1: grass.
Tap a square to paint. Water blocks the route. The start and home stay put.
Ready. The route previews are computed locally; press Compare routes to follow them.
Jonathan directed this workshop; Codex implemented it using established Dijkstra and A* algorithms. Your edits run real searches locally. AI helped build the tool; it does not invent a new program during your visit.
Keep what earns its place
Does the upgrade hold up?
Try your map, then compare both programs on the same development cases. Keeping a version changes this workshop; it does not establish performance on unseen tasks.
Every tested journey must finish and none may get worse. Improvement needs at least one better result. Compare route cost first, then squares examined when costs tie. This counts search work, not seconds.Valid means a rule can run. Non-regressing means every journey completes and none gets worse. Improved also requires at least one better result. Route cost comes first. At equal cost, fewer examined squares wins. Search work is not a wall-clock speed measurement.
Inspect every comparison
| Challenge | Current | Proposed | Outcome |
|---|
Try to break the improvement
Does it survive a different world?
Run 128 scenarios across dry or wet ground and energy or distance goals. The batch includes repeated open-ground controls. Open ground, obstacles, rough terrain and sealed barriers expose different failures. A separate Bellman-Ford implementation checks both answers. It was written by the same authoring team; the data remains development data.
Ready. Every run compares Dijkstra with A*, independently of your workshop promotion.
Read both routes as coordinates
Seeds make runs repeatable. These are development tests, not an untouched holdout or a speed benchmark. Unreachable maps must be identified correctly. Cases sharing one map are related observations.
Reproduce the test outside this website
Download the evaluator and routing model to reproduce a report with Node: import('./stress.mjs').then(m => console.log(m.runStress(42))). Save both files in the same folder; replace 42 with the seed in your report.
Your creation, beyond this page
Take the playground home.
Keep your terrain, rules and a working route explorer in one HTML file. Open it offline, change the weather, and try another idea.
What did AI actually change?
The first version compared a fixed terrain estimate with the true cost. This revision starts with Dijkstra's exact-cost search. The proposed A* search adds Manhattan distance to its priority and prefers positions closer to home when priorities tie. Each move costs at least one, so this distance never overestimates the remaining cost.
These are established algorithms, not an AI discovery. Codex implemented the comparison, stress generator, reference check and exports under Jonathan's direction. The opening map is a selected example. No human performance benchmark or autonomous self-improvement is claimed.
Development record and exact sourcesYour experiment history
Rejected and unchanged ideas stay in the record even when they do not become the active version. The most recent 20 events stay in this visit and in your evidence download.
- No comparisons yet.
Follow the routes as text
Run a comparison to inspect the coordinates.
What can these comparisons establish?
This workshop lets you compare and retain a routing change on stated development cases. It does not include an untouched evaluation set. Freeze the candidate, the baseline, the task and the goal. Check the actual result. Once feedback guides another change, those examples are development data, not an untouched final test. Editing this workshop invalidates its previous comparison.
Real self-improvement research can use a model to propose code and an evaluator to check it. Improving that task program is different from improving the process that invents future changes.
File details on this page
Format, size and a short SHA-256 identifier, measured when this page was built.
- provenance.jsonJSON, 4.0 KB, sha256 b282cb0516d7