Generator

How close the search gets

A generator in the what it costs to know library, called 7 times across 3 essays. Below: what it draws at its defaults and at the arguments the essays give it, what it checked while drawing, and everywhere it is used.

packing-shortfall is one function. Everything below came out of it during this build, at arguments taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and when the generator changes, this page changes with it.

At its defaults

How close the search getsFor each number of discs where the optimum has been proved, the radius a seeded annealing search in this repository found and the radius somebody proved is best. The bar is the shortfall as a fraction of the optimum. The figure refuses to draw if the search ever exceeds a published value, which would mean one of the two is wrong.discsfoundproved bestshort by20.292880.292890.00%30.254310.254330.01%40.250000.25000matched50.207050.207110.03%60.187580.187680.05%70.174360.174460.06%80.170220.170540.19%90.166670.16667matchedworst shortfall 0.19% of the radius, at 8 discsthe search never consults the published values, so the comparison measures the searchbeyond nine discs there is nothing to compare against, because nothing has been proved

counts: [2, 3, 4, 5, 6, 7, 8, 9]

How close the search getsFor each number of discs where the optimum has been proved, the radius a seeded annealing search in this repository found and the radius somebody proved is best. The bar is the shortfall as a fraction of the optimum. The figure refuses to draw if the search ever exceeds a published value, which would mean one of the two is wrong.discsfoundproved bestshort by20.292880.292890.00%30.254310.254330.01%40.250000.25000matched50.207050.207110.03%60.187580.187680.05%70.174360.174460.06%80.170220.170540.19%90.166670.16667matchedworst shortfall 0.19% of the radius, at 8 discsthe search never consults the published values, so the comparison measures the searchbeyond nine discs there is nothing to compare against, because nothing has been proved

counts: [2, 3, 4, 5, 6, 7, 8, 9], restarts: 120, steps: 6000

How close the search getsFor each number of discs where the optimum has been proved, the radius a seeded annealing search in this repository found and the radius somebody proved is best. The bar is the shortfall as a fraction of the optimum. The figure refuses to draw if the search ever exceeds a published value, which would mean one of the two is wrong.discsfoundproved bestshort by20.292880.292890.00%30.254310.254330.01%40.250000.25000matched50.207050.207110.03%60.187580.187680.05%70.174360.174460.06%80.170220.170540.19%90.166670.16667matchedworst shortfall 0.19% of the radius, at 8 discsthe search never consults the published values, so the comparison measures the searchbeyond nine discs there is nothing to compare against, because nothing has been proved

counts: [2, 3, 4, 5, 6]

How close the search getsFor each number of discs where the optimum has been proved, the radius a seeded annealing search in this repository found and the radius somebody proved is best. The bar is the shortfall as a fraction of the optimum. The figure refuses to draw if the search ever exceeds a published value, which would mean one of the two is wrong.discsfoundproved bestshort by20.292880.292890.00%30.254310.254330.01%40.250000.25000matched50.207050.207110.03%60.187580.187680.05%worst shortfall 0.05% of the radius, at 6 discsthe search never consults the published values, so the comparison measures the searchbeyond nine discs there is nothing to compare against, because nothing has been proved

What it checked while it drew

Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.

Where it is called

Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.

Every generator · The what it costs to know field · The patterns a reader can fold