Advent of APL

Advent of Code solutions written in Dyalog APL, organized into Acre projects

Notes

This repo will contain solutions to all problems of AoC 2015 onwards, and the progress will likely be VERY slow. Please don't expect up-to-date solutions for the latest AoC event. (It's partially because I'm often busy with every-day job, and partially because I don't really like time-constrained competition.)

The solutions (and test cases) are organized as Acre projects, so that the source code is readable without the Dyalog interpreter. Each solution will be fully annotated with comments.

You can try out the solutions without installing Dyalog APL, by opening this repo on Gitpod. If you want detailed instructions on how to use it (or use it better), please open an issue. Also, any suggestions to improve the solutions (regarding performance, style, whatever) are welcome.

Current progress

AoC 2015

• ★P means that the solution exploits a Pattern in the input (and is therefore not a general solution of the problem as described).
• Day 4: Skipped since it requires an MD5 function implementation.
• Day 11: Solved without code.

AoC 2015	1	2	3	4	5
01~05	☆ ★	☆ ★	☆ ★	Skip	☆ ★
06~10	☆ ★	Circuit ☆ ★	☆ ★	DistanceSums ☆ ★	LookSay ☆ ★
11~15	Skip	☆ ★	HappyTable ☆ ★	Distance ☆ Movements ★	Partitions ☆ ★
16~20	☆ ★	☆ ★	GoL ☆ GoLStuck ★	SubEach ☆ ★ ★P	DivisorSum ☆ ☆P DivisorLimit ★ ★P
21~25	Fight ☆ ★		RunPgm ☆ ★	Solve ☆P ★P

AoC 2016

AoC 2016	1	2	3	4	5
01~05
06~10
11~15
16~20
21~25

AoC 2017

AoC 2017	1	2	3	4	5
01~05
06~10
11~15
16~20
21~25

AoC 2018

AoC 2018	1	2	3	4	5
01~05
06~10
11~15
16~20
21~25

AoC 2019

AoC 2019	1	2	3	4	5
01~05
06~10
11~15
16~20
21~25