codemicro/adventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update README layouts

Browse source
This commit is contained in:
akp 2020-12-12 12:11:10 +00:00
parent 8f6e666afd
commit f5afabaadf
No known key found for this signature in database
GPG key ID: D3E7EAA31B39637E
2 changed files with 11 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

6
10-adapterArray/README.md
View file

@ -1,6 +1,6 @@
# [Day 10: Adapter Array](https://adventofcode.com/2020/day/10)
## Part two explaination
### Part two explaination
If you take away all the extra details, all we're being asked to do in part two is to find the number of valid possible orderings of the list of joltages where a given ordering is valid if:
@ -27,6 +27,10 @@ We can find the number of valid combinations to get to the value `n=3` by doing
Using this method, we can find the answer to part two with a very small algorithm that's only 7 lines long, excluding data parsing.
### Related
* [Computerphile - Tail recursion](https://www.youtube.com/watch?v=_JtPhF8MshA)
---
<details><summary>Script output</summary>

7
11-seatingSystem/README.md
View file

@ -1,6 +1,9 @@
# [Day 11: Seating System](https://adventofcode.com/2020/day/11)
This is a [cellular automata](https://en.wikipedia.org/wiki/Cellular_automaton) that (in part one) uses the [Moore neighbourhood](https://en.wikipedia.org/wiki/Moore_neighborhood).
### Related
* [Wikipedia - Cellular automata](https://en.wikipedia.org/wiki/Cellular_automaton)
* [Wikipedia - Moore neighbourhood](https://en.wikipedia.org/wiki/Moore_neighborhood)
### Visualisation
@ -8,6 +11,8 @@ This is a [cellular automata](https://en.wikipedia.org/wiki/Cellular_automaton)
| ------------------------------ | ------------------------------ |
| ![partOne gif](0.gif?raw=true) | ![partTwo gif](1.gif?raw=true) |
---
<details><summary>Script output</summary>
```