diff options
Diffstat (limited to 'docs/community/aoc.html')
| -rw-r--r-- | docs/community/aoc.html | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/docs/community/aoc.html b/docs/community/aoc.html new file mode 100644 index 00000000..7c0c717f --- /dev/null +++ b/docs/community/aoc.html @@ -0,0 +1,55 @@ +<head> + <link href="../favicon.ico" rel="shortcut icon" type="image/x-icon"/> + <link href="../style.css" rel="stylesheet"/> + <title>BQN: Advent of Code</title> +</head> +<div class="nav">(<a href="https://github.com/mlochbaum/BQN">github</a>) / <a href="../index.html">BQN</a> / <a href="index.html">community</a></div> +<h1 id="advent-of-code"><a class="header" href="#advent-of-code">Advent of Code</a></h1> +<p><a href="https://adventofcode.com/2021">Advent of Code 2021</a> saw great participation by the BQN community, with a total of 225 solutions published by 22 programmers. They can be found in these repositories:</p> +<center> + +<p><a href="https://github.com/razetime/AOC2021-BQN">Raghu Ranganathan</a> • +<a href="https://github.com/dzaima/aoc/tree/master/2021/BQN">dzaima</a> • +<a href="https://github.com/dancek/bqn-advent2021">Hannu Hartikainen</a> • +<a href="https://github.com/frasiyav/AoC2021">frasiyav</a> • +<a href="https://github.com/leahneukirchen/adventofcode2021">Leah Neukirchen</a> • +<a href="https://github.com/Detegr/aoc2021">Antti Keränen</a> • +<a href="https://gitlab.com/icen/aoc21">Caleb Quilley</a> • +<a href="https://github.com/AlexDikelsky/puzzles/tree/main/advent_of_code/advent_2021">Alex Dikelsky</a> • +<a href="https://github.com/andreypopp/aoc2021">Andrey Popp</a> • +<a href="https://github.com/JohnnyJayJay/adventofcode-21">Johnny</a> • +<a href="https://github.com/bddean/aoc-2021">Ben Dean</a> • +<a href="https://github.com/alvinvoo/aoc2021">Alvin Voo</a> • +<a href="https://git.sr.ht/~jshholland/adventofcode/tree/master/item/2021">Josh Holland</a> • +<a href="https://github.com/alephno/aoc2021/tree/main/BQN">Alastair Williams</a> • +<a href="https://github.com/Olodus/advent_of_code2021">Olodus</a> • +<a href="https://github.com/arwn/aoc2021">Aren Windham</a> • +<a href="https://github.com/dlozeve/aoc2021">Dimitri Lozeve</a> • +<a href="https://github.com/knightzmc/advent-of-code-2021">Alexander Wood</a> • +<a href="https://github.com/mathiasmagnusson/advent-of-code-21">Mathias Magnusson</a> • +<a href="https://github.com/m-lima/advent-of-code-2021">m-lima</a> • +<a href="https://github.com/dunyakirkali/aoc.bqn/tree/main/2021">Dunya Kirkali</a> • +<a href="https://github.com/Camto/Advent-of-Code-2021/tree/master/BQN">Benjamin Applegate</a></p> +</center> + +<p>In addition to these, Leah wrote two blog posts explaining her solutions for <a href="https://leahneukirchen.org/blog/archive/2021/12/counting-lanternfish-with-bqn-and-linear-algebra.html">day 6</a> and <a href="https://leahneukirchen.org/blog/archive/2021/12/surveying-lava-basins-with-bqn-and-fixpoints.html">day 9</a>.</p> +<p>The number of solutions for each of the 25 days is plotted below, along with totals from AoC's <a href="https://adventofcode.com/2021/stats">stats page</a>. The BQN solutions are scaled to be visible here: there are 6839 times more valid AoC submissions than published BQN solutions overall.</p> +<svg viewBox='-40 -25 336 178'> + <g stroke-width='1' font-size='13px' text-anchor='end' fill='currentColor'> + <rect class='code' stroke-width='1' rx='6' x='-20' y='-20' width='296' height='168'/> + <text x='256' y='9'>Solutions in:</text> + <text class='red' x='256' y='27'>Anything</text> + <text class='green' x='256' y='45'>BQN</text> + <g text-anchor='middle' opacity='0.8'> + <text dy='1em' x='128' y='128'>day</text> + <text transform='rotate(-90)' dy='-0.35em' x='-64' y='0'>count</text> + </g> + <path class='Paren' stroke='currentColor' d='M0 0V128'/> + <path class='Paren' stroke='currentColor' d='M0 128H256'/> + <path class='red' style='fill:none' d='M0 0L10.667 21.264L21.333 34.323L32 67.236L42.667 74.891L53.333 74.614L64 77.743L74.667 83.081L85.333 86.676L96 90.878L106.667 95.52L117.333 99.675L128 99.124L138.667 99.02L149.333 105.35L160 109.476L170.667 109.563L181.333 114.835L192 119.484L202.667 115.945L213.333 114.298L224 116.936L234.667 120.62L245.333 122.454L256 120.653'/> + <path class='green' style='fill:none' d='M0 49.776L10.667 70.361L21.333 53.893L32 78.595L42.667 74.478L53.333 66.244L64 66.244L74.667 95.063L85.333 78.595L96 90.946L106.667 90.946L117.333 99.18L128 90.946L138.667 95.063L149.333 95.063L160 107.415L170.667 99.18L181.333 103.298L192 111.532L202.667 99.18L213.333 103.298L224 111.532L234.667 119.766L245.333 111.532L256 111.532'/> + </g> +</svg> + +<p>The BQN counts fall off much less than the average. Most likely this is because programmers who decide to try AoC in a crazy new language like BQN tend to be more committed to the task, but BQN also has to meet some minimum bar to enable these crazy people to continue.</p> +<p>Just how okay is BQN? Further discussion to come.</p> |