Slice Crawl

Practice site for the puzzle: try your estimate() on as many random crawls as you like.

Goal: name the true best of the pizza shops in at least 95% of crawls, tasting as few slices (averaged over many crawls) as you can.

crawl.taste(i) buys a slice from shop i and returns its rating; estimate(crawl) returns the shop you believe is best. Everything runs here in your browser, and nothing leaves it unless you add a run to the leaderboard.

How your code is run

Your code

Starting Python...

Run

Estimator

Each crawl: 8 shops, bell-curve ratings. The same seed gives the same crawls, whatever the estimator.

 

Runs

Saved in this browser only. Click a row for its post-mortem and code, a name to rename it, a heading to sort. “Right” is ± 2 standard deviations; maybe means that range includes 95%, so run more crawls to tell. “Add baselines” runs the simplest estimators on the same crawls.

Post-mortem

Click a run above to go through its crawls one by one, with the hidden truth revealed.

Leaderboard

Every score here is our own re-run: 5000 fresh crawls of the official setup, on a seed nobody has seen. To add yours, use Add to leaderboard on a row of the Practice tab's runs.

#NameMethod RightAvg slices Median90th pct Posted

Add to the leaderboard

Run:

We re-run this code on our end, on 5000 fresh crawls with a new seed nobody has seen. The board shows that score, not this run's, so expect it to differ a little; it usually appears within the hour.

Your code is saved with the entry, and only the instructor can see it. Adding another run later replaces your entry.