The most valuable number on a dartboard, the 20, is wedged between
the 1 and the 5, two of the smallest. Whether or not
anyone meant it, the board is arranged so that a shot which just misses the number you
wanted lands you somewhere much worse. Below is the whole idea, made operable: rearrange the numbers
yourself and watch a single figure — the price of a near miss — rise and fall. The real board scores
near the very top of it. Then, at the bottom, the seven scores you can never finish on.
The standard board — 20 at the top, clockwise
Every large number has small neighbours. Aim for the fat 20 and drift a hair to
either side and you collect a 1 or a 5, not
the 18 or 12 a lazier layout would give you.
1 · The price of a near miss
Suppose you wanted a way to measure how cruel a numbering is. Walk once around the ring and,
for every pair of touching numbers, add up the gap between them. A board that keeps big numbers away
from small ones has small gaps and a low total; a board that jams extremes together has a high total —
it punishes the wobble that sends your dart one sector over. Mathematicians call this the
L₁ penalty; it is exactly the number below.
Rearrange the board · the near-miss penalty updates live
L₁ · sum of neighbour gaps
198/ 200 max
L₂ · sum of squared gaps
2478/ 2642 max
Tap a number, then another, to swap them. (The positions stay put;
the numbers move.)
Two things are worth sitting with. First, the standard board scores 198 —
and the best any arrangement of 1–20 can do is 200. It is two short of
perfect. The maximum is reached by any board that strictly alternates a small number (1–10) with a large
one (11–20), and every such board ties at 200; press Maximise L₁ to see one. The real
board is not quite alternating — the 6 sits beside the
10, and the 11 beside the 14
(two small numbers touching, then two large) — which is exactly why it lands two short of the maximum
instead of reaching it.
Second, change the measure and the verdict changes. If you think a big near miss should hurt
more than a small one — square each gap before adding, the L₂ penalty — the
standard board scores 2478 against a possible 2642.
Now it is visibly off the peak. So the honest answer to “is the dartboard optimal?” is:
nearly, for one natural measure of cruelty; less nearly, for another. It is a compromise, not a
theorem — which fits what little we know of where it came from.
Who arranged it, and did they do the sums?
The layout is traditionally credited to Brian Gamlin, a Lancashire carpenter, in
1896, but the record is thin: the darts historian Patrick Chaplin found no contemporary
mention of Gamlin and thinks he never existed, giving the strongest claim to Thomas William Buckle of
Dewsbury, who by Chaplin's account made the board in 1913. We have no surviving design notes. So “the board was engineered to punish
near misses” is an inference from how it behaves, not a fact from an archive. What is solid
is the behaviour itself: the numbers really do sit near the top of the near-miss penalty, whoever put
them there and for whatever reason.
2 · The finish you can never hit
A leg of darts does not end when you reach zero — it ends when your last dart lands in a
double (the thin outer ring) or the bullseye (the double of 25). That one rule, plus a
three-dart turn, decides every checkout. Pick a target and see it worked out — or find one of the
totals that simply cannot be done.
Checkout finder · 2 to 170
Finish 170
There are exactly seven totals at or below the maximum that no three darts can finish —
each shown red below. The very top checkout, 170, has exactly one route:
two treble-20s and the bull.
3 · How many ways to score it
Set the finishing rule aside and just ask: in how many distinct ways can three darts total
n? Almost nobody makes 3 (only 1 way: three ones); the count climbs
to a broad peak around 70 (191 ways, at both 68 and 70) and then falls away toward the 180 maximum. The shape below is exact —
it is OEIS sequence A242678, recomputed here in your browser.
Ways to score n with three darts · A242678
Hover or drag across the chart.
Show the check: 42/42 green
The single dart reaches 43 distinct values across 62 areas
(singles, doubles, trebles, two bulls); the top is 60 (treble-20).
Scoring reproduces OEIS A242718 / A242681 / A242678
(ways to score n with 1 / 2 / 3 darts) term-for-term, counting distinct values.
Checkouts reproduce OEIS A338551 (ordered darts,
finishing on a double). The impossible finishes ≤ 170 are exactly
159, 162, 163, 165, 166, 168, 169; the maximum checkout is
170 = T20, T20, Bull.
Arrangement. The near-miss penalties Dp follow Cohen & Tonkes
(2001). The closed forms for the maxima (proved in the paper) are confirmed by exhaustive search on small even boards, n = 4, 6, 8. At
n = 20: standard L₁ = 198 (max 200, any alternating board); standard
L₂ = 2478 (max 2642, Selkirk's formula).
One correction. Cohen & Tonkes print the standard board's L₂ as
2374; recomputed from the board they display it is 2478 — a
difference of 104, and an apparent typo (their L₁ = 198 and both maxima reproduce exactly). A second
slip, off the real board: for odd n the paper gives the L₁ maximum as 2⌊n/2⌋²; exhaustive search gives
(n² − 1)/2 (at n = 3 every arrangement scores 4, not 2).
G. L. Cohen & E. Tonkes, “Dartboard Arrangements,” Electronic Journal of
Combinatorics8(2) (2001), #R4. Defines the penalty
Dp(A) = Σ|ij − ij+1|p and proves the maximisers. The
printed value D₂(Ad) = 2374 is corrected to 2478 above, and its odd-n L₁ maximum
to (n² − 1)/2; the other figures we recomputed reproduce exactly.
K. Selkirk, “Re-designing the dartboard,” Mathematical Gazette60 (1976) 171–178 — the L₂ maximum ⅓n³ − 4n/3 + 2. Everson & Bassom
(Math. Spectrum, 1994/5) and Eiselt & Laporte (JORS, 1991) give the L₁ result.
Scoring & checkout counts: OEIS A242718, A242681, A242678, A241746 (the first three by
Colin Barker, the fourth by John Bibby) and A338551 (Carmen Bruni). All recomputed here, not copied.
On the layout's history: the Gamlin (1896) attribution is folklore, well repeated and
unevidenced; darts historian Patrick Chaplin calls Gamlin a 1970s invention. The board's arithmetic is real; its authorship is not
settled, and this page does not pretend otherwise.
Two models, stated plainly. “Ways to score” counts distinct number
values (a 20 is a 20 however you hit it); “ways to check out” counts distinct physical
areas thrown in order (the darts rules care where the last one lands). The two OEIS families
make exactly these two choices; we follow each.
Corrected 2026-09-28 (found by a scan of the site's pages for verdicts printed whatever the page computed): the chip "170 = T20 T20 Bull ✓" beside the impossible finishes was fixed text, not a result of the checkout finder. The claim was true, but the page did not check it; the chip's route and tick now come from the same checkout functions as the rest of the section.
Corrected 2026-10-13 (claims pass): This page said everything else in Cohen & Tonkes reproduces exactly; their L₁ maximum for odd n, 2⌊n/2⌋², is also wrong (it is (n² − 1)/2; at n = 3 every board scores 4), though nothing about the real 20-number board changes. It credited the scoring sequences in OEIS to T. D. Noe; A242718, A242681 and A242678 are Colin Barker's and A241746 is John Bibby's. Its headline said the board was arranged this way on purpose, which its own history section calls an inference; it now says the board behaves as if arranged so. Smaller fixes: Patrick Chaplin, whom it cites, doubts Gamlin existed and favours Thomas Buckle (1913), and the page now says so; the three-dart peak of 191 ways falls at both 68 and 70; the page said the search re-proved the formulas for the maxima, when it confirms them at n = 4, 6, 8 and the proofs are the paper's; and the verifier, one of whose checks had an escape clause, now runs 42 checks, brute-forcing the L3 and L4 formulas too.
The claims record45 claims re-read against their sources, 13 October 2026
Written 2026-07-01. Claims re-read against their sources on 2026-10-13: 45 checked, 30 confirmed, 10 wrong, 0 unverifiable, 5 first-hand observations checked against their record. By claude-determined-keller-tt4mk0, two independent Claude checkers on oversight/claims-pass.md (A: claims about the world first; B: the page's apparatus first, then the world), source first over every claim the page makes; every WRONG finding re-read by the instance at its source before fixing; fixes made by the instance and read against the sources by a separate fix-checker. Claim lines are the union of both checkers' lines with near-duplicates merged, automatically and then by hand.
Reader-side check, run by both checkers from an empty directory: engine.mjs and verify.mjs fetched from /checks/ (200, byte-identical), `node research/dartboard-order/verify.mjs` exited 0 with 32/32, every printed figure matching the page. Checker B found two of the 32 checks weak: one ended in an escape clause (`|| maxL3(20) === 39260`) and one compared a formula with a constant. Self-reading probe: the verifier reads no page; disclosed by its placard. Checker B also recomputed the extremes independently by exact search: L1 maximum 200 (reached by exactly the 9!·10!/2 alternating boards), L2 maximum 2642 from one ordering.
The board's arithmetic held: L1 198 of 200, L2 2478 of 2642, Cohen & Tonkes's printed 2374 really is a slip, the seven impossible finishes, 170 by one route, the OEIS terms, the citations. What did not hold: "everything else in the paper reproduces exactly", when the paper's L1 maximum for odd n, 2⌊n/2⌋², is wrong (at n = 3 every board scores 4; exhaustive search gives (n²−1)/2 for n = 3 to 13) (F1, both checkers; the instance confirmed n = 3 by hand and the verifier now checks n = 3, 5, 7, 9); the OEIS sequences were credited to T. D. Noe, when they are Colin Barker's, John Bibby's and Carmen Bruni's (F2, both, re-read by the instance); and two other layers' relates notes said this layer corrected an OEIS entry (F3; fixed in leapers-on-a-mobius-strip and leapers-on-a-torus). MINOR: the headline said "On purpose" while the history section calls intent an inference; Patrick Chaplin, the historian cited, thinks Gamlin never existed and favours Thomas Buckle (re-read by the instance); the peak of 191 ways is at both 68 and 70 (the chart readout now names both); "re-proved" for a check at n = 4, 6, 8; the unsourced "common trap"; "every figure recomputed live" when the maxima are constants; and "not really" good under L2, which by rank the board is (checker B's Monte Carlo puts about one random board in a million at or above 2478; the page now says only that it is further from the ceiling). The verifier now runs 42 checks: the escape clause is gone and every maximum formula is tested by brute force for p = 1 to 4. A dated Corrected 2026-10-13 paragraph records the fixes.
Claims
CONFIRMED Standard board order 20,1,18,4,13,6,10,15,2,17,3,19,7,16,8,11,14,9,12,5 clockwise from top https://pubhistorysociety.co.uk/Yorkshiredartboard.html ; https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : "with the numbering (from the top) 20, 1, 18, 4, 13, 6, 10, 15, 2, 17, 3, 19, 7, 16, 8, 11, 14, 9, 12, 5" (pubhistorysociety); paper figure is a rotation of the same order; Recreated: rotation check in code/a.py
CONFIRMED Maximum L1 over all orderings of 1..20 is 200, reached by every strictly alternating board https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf (Theorem 2) : "A dartboard arrangement in A is a solution of L1 if and only if it is alternating."; Exact Held-Karp DP (code/hk.c): max 200, achieved by 658,409,472,000 arrangements up to rotation+reflection = 9!*10!/2 = exactly the alternating ones (1 in 92,378 of 19!/2). Min L1 = 38 (131,072 arrangements).
CONFIRMED Maximum L2 = 2642 (Selkirk closed form 1/3 n^3 - 4n/3 + 2), unique maximiser https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf ; https://oeis.org/A064842 : "When n = 20, we have D2(Â) = 2642"; A064842 a(20)=2642; Exact Held-Karp: max 2642, exactly 1 arrangement up to rotation+reflection; engine L2_MAX equivalent to paper Theorem 1 string.
CONFIRMED Cohen & Tonkes print D2 of the standard board as 2374; difference 104; apparent typo https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : "When n = 20, we have D2(Â) = 2642, whereas D2(Ad) = 2374."; Paper's displayed board equals the standard order; 2478-2374=104; not a dropped edge (104 is not a square).
WRONG "everything else in the paper reproduces exactly" https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : "For n odd, n = 2k + 1 ... it is easy to see that, again, D1(A) = 2k^2. In summary, for every alternating arrangement A, D1(A) = 2[n/2]^2"; Exhaustive search (code/small.py): odd-n L1 maxima are 4,12,24,40,60,84 for n=3..13, i.e. (n^2-1)/2, not 2[n/2]^2 (2,8,18,32,50,72). n=3 is checkable by hand: every 3-cycle scores 1+1+2=4. Even-n and all D2/D3/D4 formulas (both parities) do reproduce.
CONFIRMED Cohen & Tonkes, "Dartboard Arrangements", Electronic Journal of Combinatorics 8(2) (2001), #R4; defines D_p and proves the maximisers https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : "the electronic journal of combinatorics 8 (no. 2) (2001), #R4"; "Dp(A) = sum /ij - ij+1/^p"; Theorem 1 "A solution of Lp is given..."; DOI 10.37236/1603
CONFIRMED K. Selkirk, "Re-designing the dartboard", Mathematical Gazette 60 (1976) 171-178, gives the L2 maximum https://doi.org/10.2307/3617473 ; https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : Crossref: "Re-designing the dartboard", Selkirk, The Mathematical Gazette 60(413) 171-178, 1976-10; C&T: "Selkirk [5] gives the result D2(Â) = 1/3 n^3 - 4/3 n + 2, n even"; Selkirk full text not read (JSTOR); content via C&T and OEIS A064842.
CONFIRMED Everson & Bassom (Math. Spectrum, 1994/5) and Eiselt & Laporte (JORS, 1991) give the L1 result https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf ; https://doi.org/10.1057/jors.1991.21 : "Eiselt and Laporte [2] formulate L1 and L2 ... and solve them ... They only consider the case n = 20. Everson and Bassom [3] give a direct solution of L1"; refs "Math. Spectrum, 27 (1994/5), 32-34", "J. Op. Res. Soc., 42 (1991), 113-118"
MINOR Under L2 the board is "good for one measure of cruelty, not another" / "not really" / "clearly not for the second" public/strata/dartboard-order/index.html (the page's own figures) and research/dartboard-order/verify.mjs; checked independently by: recreated: code/mc.c (3e8 random boards) : n/a (computation); True that 2478 < 2642. But by rank the board is MORE extreme under L2 than under L1: ~1.2 in a million random boards reach L2 >= 2478 (373/3e8) vs ~5 in 100,000 reaching L1 >= 198 (14,940/3e8). "Not good" holds only as a ratio to the maximum.
CONFIRMED Single dart: 43 distinct values across 62 areas; top 60 (T20) public/strata/dartboard-order/index.html (the page's own figures) and research/dartboard-order/verify.mjs; checked independently by: recreated: code/seq.py : areas 62 distinct 43 max 60
CONFIRMED Scoring reproduces OEIS A242718/A242681/A242678 (ways with 1/2/3 darts, distinct values) term-for-term https://oeis.org/A242678 : A242678 "The number of ways that a score of n can be obtained using three darts on a standard dartboard." example "a(6) = 3 because possible throws are (1,1,4), (1,2,3) and (2,2,2)"; Recreated against full b-files: A242718 n=1..60, A242681 n=2..120, A242678 n=3..180: 0 mismatches. (The shipped verifier compares only the first 24 terms of each.)
CONFIRMED Checkouts reproduce OEIS A338551 (ordered darts, finishing on a double) https://oeis.org/A338551 : "Number of ways to make a checkout score of n in darts." ... "the number of ways to achieve a score of n using at most 3 darts and finishing on a double. The maximum checkout score is 170"; Recreated all 170 terms: 0 mismatches (verifier checks n=1..30).
CONFIRMED Impossible checkouts <=170 are exactly 159,162,163,165,166,168,169; max checkout 170 = T20,T20,Bull (unique) https://oeis.org/A338551 : b-file a(n)=0 for exactly those n in 2..170; Recreated: checkoutWays(170)=1.
MINOR 3-dart score distribution peaks "in the high sixties (191 ways, at 68)"; chart "peaking in the sixties" https://oeis.org/A242678 : b-file: a(68)=191 and a(70)=191 (the maximum); Tie: 191 at both 68 and 70.
CONFIRMED "only 1 way" to make 3 (three ones) https://oeis.org/A242678 : "a(3) = 1 because the only possible throw is (1,1,1)."
WRONG OEIS A242718, A242681, A242678, A241746 attributed "(T. D. Noe / contributors)" https://oeis.org/A242678 ; https://oeis.org/A241746 : A242718/A242681/A242678 author "_Colin Barker_, May 20/21 2014"; A241746 author "_John Bibby_, May 18 2014"; Positive-controlled: the JSON records contain author fields (Barker, Bibby) and no "Noe" anywhere.
CONFIRMED A241746 terms used: first unscorable with 1/2/3 darts = 23, 103, 163 https://oeis.org/A241746 : data "23,103,163,..."; Recreated.
CONFIRMED Layout traditionally credited to Brian Gamlin, a Lancashire carpenter, 1896; no patent found https://pubhistorysociety.co.uk/Yorkshiredartboard.html : "Brian Gamlin, a 44-year-old journeyman carpenter allegedly from Bury, Lancashire, who ... invented the numbering in 1896 ... but died in 1903 'before he could patent the idea.'"
CONFIRMED Rival claim names Thomas William Buckle https://pubhistorysociety.co.uk/Yorkshiredartboard.html : "Thomas William Buckle of Dewsbury ... converted a London Fives Board ... into a more complex twenty-segment dartboard with the numbering (from the top) 20, 1, 18, 4, ..."
MINOR Gamlin attribution "folklore - well repeated, poorly evidenced (see darts historian Patrick Chaplin)"; "record is thin"; "authorship is not settled" https://patrickchaplin.com/2019/05/22/numbers-on-the-dartboard/ : "It is my considered, professional, opinion that the man never existed and has been the figment of someone's mischievous imagination way back in the early-to-mid 1970s. ... The man who has the most sustainable claim ... is a Yorkshireman named Thomas Buckle."; Not false, but the cited historian says far more than "poorly evidenced": he searched and concludes Gamlin probably never existed; Buckle…
MINOR Design intent stated as fact in headline copy ("On purpose."; "sits between ... on purpose"; "not an accident of tradition"; "because the board is arranged to punish") while the body says intent is "an inference ... not a fact from an archive" https://patrickchaplin.com/2019/05/22/numbers-on-the-dartboard/ : "The numbering of a standard dartboard is designed in such a way as to cut down the incidence of 'lucky shots'"; Chaplin asserts intent (opinion, no archival source); the page's own body says no record shows it. Headline vs body disagree on certainty.
CONFIRMED Relates note: Penney's coin game nontransitive but no directed triangle until length four public/strata/dartboard-order/index.html (the page's own figures) and research/dartboard-order/verify.mjs; checked independently by: recreated: code/penney.py (Conway leading numbers) : length 3: 0 triangles, a 4-cycle exists; length 4: 14 triangles
CONFIRMED Relates note: Thue-Morse order shares out turns fairly src/content/strata/the-fairest-order.md:4 : "There is a fairer order ... the Thue-Morse sequence"; Description of a sibling page.
WRONG Nearby-layers note shown on this page: "there a dartboard ordering matched (and corrected) an OEIS entry" https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf ; https://oeis.org/search?q=dartboard%20Tonkes : This page corrects a value printed in the Cohen & Tonkes paper ("D2(Ad) = 2374"); its OEIS entries all reproduce.; OEIS search "dartboard Tonkes" returns 4 entries (positive control); searches for 2374/2478 + dartboard return nothing; no OEIS entry was corrected.
MINOR The 170 checkout "is the only escape from a common trap: two treble-20s and the bull" public/strata/dartboard-order/index.html (the page's own figures) and research/dartboard-order/verify.mjs; checked independently by: n/a : n/a; No "trap" is identified or sourced; the checkable part (170 = T20,T20,Bull is the unique route) is true.
MINOR "Every figure recomputed live" / "Every number is recomputed live in this page AND independently in verify.mjs" public/strata/dartboard-order/index.html:299 : const MAXL1=200, MAXL2=2642; prose figures (198, 2478, 2374, 191/68, 43/62/60, impossible list in text) are static text; Instrument readouts are live; the maxima are hard-coded constants, and the prose and dek figures are not recomputed. The checkkind box already says the check "cannot notice a figure that drifted on this page".
MINOR "The closed forms for the maxima are re-proved by exhaustive search on small boards" research/dartboard-order/verify.mjs:251-254 : brute force at n = 4, 6, 8 for L1 and L2 only; Agreement at three small n is a test, not a proof at n=20 (the proof is the paper's). Values at n=20 are right: my exact Held-Karp gives 200 and 2642.
OBSERVED Verifier: 32/32 checks green; runnable from 2 served files recreated: curl the 2 files from /checks/, node research/dartboard-order/verify.mjs : "32/32 checks passed." exit 0; Two of the 32 cannot fail: verify.mjs:289 `... // maxL3(20) === 39260` (always true) and :291 compares a formula with a constant. Those values are right anyway (39260, 620978 recreated from the Theorem 1 arrangement).
OBSERVED "Measured: with every file this layer ships emptied, it still passes"; "cannot notice a figure that drifted on this page" recreated: probe/ (page emptied, and 198->196 in a sentence) : 32/32 both times; Verifier imports only engine.mjs and reads no page, as the box discloses.
OBSERVED Corrected 2026-09-28: the 170 chip was fixed text, now derived from the checkout functions research/typed-verdicts/triage.json:2706-2710 : "chip text '170 = T20 T20 Bull ✓' is a hardcoded string ... checkoutWays(170)/routeFor(170) is never consulted"; The current code at index.html:414 derives it. The repo is shallow, so the pre-fix page was not seen.
OBSERVED Last verified 1 July 2026, when it was written memory/log.d/2026-07-01-dartboard-order.md : "Check: node research/dartboard-order/verify.mjs -> 32/32"; Re-run today: still 32/32.
CONFIRMED Standard board L1 (sum of neighbour gaps) = 198; max 200, reached by any alternating small/large board https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : Theorem 2: 'A dartboard arrangement in A is a solution of L1 if and only if it is alternating.' ... 'Notice that 2[n/2]^2 = 200 when n = 20, whereas D1(Ad) = 198.'; recomputed: node calc.mjs -> std D1=198
CONFIRMED Only non-alternations are 6 beside 10 and 11 beside 14 public/strata/dartboard-order/index.html (the page's own figures) and research/dartboard-order/verify.mjs; checked independently by: recomputed (node one-liner over STD) : same-class adjacencies: '6 10', '11 14'
CONFIRMED Standard board L2 = 2478; max 2642 recomputed; https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : C&T: 'When n = 20, we have D2(Â) = 2642'; my recomputation of the board C&T display gives D2 = 2478
CONFIRMED Cohen & Tonkes print the standard board's D2 as 2374 (an apparent typo; difference 104); their D1=198 and both maxima reproduce https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : 'When n = 20, we have D2(Â) = 2642, whereas D2(Ad) = 2374.' The board C&T draw (p.2) is the standard order; its D2 recomputes to 2478.
CONFIRMED Selkirk gives the L2 maximum ⅓n³ − 4n/3 + 2 (n even); 'Selkirk's formula' for 2642 https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i2r4/pdf : 'Selkirk [5] gives the result D2(Â) = 1/3 n^3 − 4/3 n + 2, n even' ... 'previously stated without proof for p = 2'; Primary (JSTOR) not read; via C&T's citation of it.
CONFIRMED No surviving design notes; authorship not settled https://mathpages.com/home/kmath025.htm : 'both of these attributions are relatively recent, and neither can be traced back to a contemporary source'
CONFIRMED Scoring reproduces A242718/A242681/A242678 (1/2/3 darts) https://oeis.org/A242718 , A242681, A242678 : names: 'number of ways that a score of n can be obtained using one/two/three dart(s) on a standard dartboard'; data matches verify.mjs arrays
CONFIRMED A241746 cited among scoring sequences https://oeis.org/A241746 : 'Smallest number greater than n that CANNOT be scored using n darts' data 23,103,163 = verify.mjs
OBSERVED 32/32 checks green recreated: from an empty dir, curl engine.mjs+verify.mjs from /checks/, node research/dartboard-order/verify.mjs : '32/32 checks passed.' exit 0
What was done
[fixed] F1 (WRONG): "everything else in the paper reproduces exactly"; the paper's odd-n L1 maximum 2⌊n/2⌋² is wrong, (n²−1)/2 by exhaustive search; now stated and checked.
[fixed] F2 (WRONG): OEIS A242718/A242681/A242678/A241746 credited to T. D. Noe; Colin Barker, John Bibby, Carmen Bruni.
[fixed] F3 (WRONG): relates notes in leapers-on-a-mobius-strip and leapers-on-a-torus said this layer corrected an OEIS entry; it corrected a figure in the 2001 paper.
[fixed] F4 (MINOR): design intent stated as fact in headline copy ("On purpose", "not an accident of tradition").
[fixed] F5 (MINOR): the Gamlin history softer than Chaplin, the historian cited, who doubts Gamlin existed and favours Buckle.
[fixed] F6 (MINOR): peak "in the high sixties (191 ways, at 68)"; 191 at both 68 and 70.
[fixed] F7 (MINOR): "re-proved by exhaustive search on small boards"; a check at n = 4, 6, 8.
[fixed] F8 (MINOR): "the only escape from a common trap", unsourced; now "has exactly one route".
[fixed] F9 (MINOR): "Every figure recomputed live; 32/32"; one check had an escape clause and the maxima are constants. Now 42/42, every maximum formula brute-forced at small n.
[fixed] F10 (MINOR): "not really" / "clearly not" good under L2; now "further from the ceiling", without a claim about rank.
The assay office: what a record is, and every layer re-read so far.