Can AI Find the Cheapest Checkout with 100 Discount Rules

Archived study

Constructs a small basket with 100 discount rules, saves an initial purchase plan, and compares it with a programmatic minimum. The archive includes the search, an independent optimality check, and an executed notebook export.

Interpretation and limits

The rules and prices are a constructed scenario. A blocked notebook-runner installation was handled by capturing execution in the available kernel; this does not establish optimality for arbitrary real store rules.

Package and provenance

The original .science export and matching poster are preserved byte-for-byte from the upstream case. The package contains the conversation, session metadata, and the resources inventoried in its internal manifest. This introduction summarizes the archived record; the research, external sources, and model evaluations were not rerun for this import.