You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
aoc-racket/README.md

60 lines
2.5 KiB

5 years ago
2015 edition
-
7 years ago
Racket solutions & explanations for the [Advent of Code](http://adventofcode.com) puzzles. Written in Racket's literate-programming dialect, `scribble/lp2`.
Install from the command line:
raco pkg install aoc-racket
Explanations will be installed automatically as part of the Scribble documentation.
[Or just read the code and explanations online, right now.](http://pkg-build.racket-lang.org/doc/aoc-racket/)
5 years ago
3 years ago
2016 & onward editions
5 years ago
-
3 years ago
Solutions in the respective annual subdirectories.
2 years ago
## MBs Advent of Code tips
* The problems are often designed around a particular computer-y abstraction. If you notice what the abstraction is, and then find the closest analog in Racket, the solution tends to come together quickly. Otherwise, you can spend a lot of time reinventing the wheel.
* Complex numbers are a nice way of modeling two-dimensional positions.
* Use lists whenever feasible, because there are many useful list functions in the Racket library that dont have vector equivalents. In particular, [these list functions](https://docs.racket-lang.org/reference/pairs.html?q=racket%2Flist#%28part._.Additional_.List_.Functions_and_.Synonyms%29) are very useful, especially `argmin` and `argmax`.
* Vectors are better than lists in situations where you need random access to members.
* `eq?` is the fastest equality check, but it only works for symbols and fixnums (therefore, use more symbols and fixnums so you can use `eq?`!)
* `match` is fantastic.
* Association lists (= lists of pairs) are underrated. Theyre compatible with all the usual list functions, of course, but also dictionary forms (like `dict-ref` and `in-dict`).
* The `graph` library can be helpful for graph-based problems.
* Its good to know about sets and mutable pairs.
* Also the fancier `for` iterators, like `for/first` and `for/or`.
* `let/ec` is a way of jumping out of a deeply nested computation, akin to how `return` works in other languages.
## My solutions
* I try to write solutions that are succinct but not cryptic.
* I dont optimize for speed.
* I like doing the Advent of Code problems because it forces me to use parts of Racket that I dont ordinarily use. So I treat it as a chance to expand my awareness of the Racketverse.
* Im unlikely to finish every problem. Judging by past years, there is a point where the problems get sufficiently complex that Id rather put that time into improving my other Racket projects :metal:
2 years ago
## Project status
I only work on this project during puzzling season.