Presentation about advent of code and how I tried solving them using code golf style (shortest possible in bytes solutions to tasks)

1. Piotr Wasiak I 2023
Advent of Code
Code Gol
fi
ng

2. Advent
of
Code

3. Advent
of
Code [Some participant] noticed 4 problems
that required algorithms on graphs:
• Day 12 where we need to compute
shortest paths to a given target (typical
algo: Dijkstra)
• Day 16 where we need to precompute all
distances from valves pairs (typical algo:
Floyd-Warshall or repeated Dijkstra) and
then traverse a graph (DFS traversal)
• Day 19 where we need to do a DFS
traversal on a graph with some smart
elimination of branches
• Day 24 where we need to do a BFS
traversal on a graph to
fi
nd a minimum
time

4. AoC
Statistics
• the further away
the more di
ffi
cult
• the less people participate

5. Advent of Code
Possible challenges
• Write solution and post as fast as possible
• Write beautiful code
• Write code for solution
fi
rst part
that will be easy adaptable to solve also second one
• Write shortest solution possible (code gol
fi
ng)

6. Advent of Code
What for can you join it?
• Improve parsing
fi
les abilities. Read more rubyapi.org
• Revisit some algorithms, or learn new :)
• Compare your solution with:
• other languages
• other Redit users (with nice visualisations and memes)
• test ChatGPT3
• Have fun with great puzzles

7. Code Golfing
Solve problem with
the shortest source code

8. Specialized languages for Code Golfing
• GolfScript
• Flogscript, Vyxal, CJam
• Pyth, Husk
• AoC winner language: Noulith

9. Showtime
• some solutions from my christmas tree

10. What I discovered during code golfing?
• More about control
fl
ow @ ruby
• STD lib functions
• scripting switches with $ can be useful
• Better parsing
fi
le abilities
• less code is not easier to understand :D

11. What I discovered
Recursive arrays
• it's quite uncommon to have it

12. Sources
• adventofcode.com
• Discord ruby code golfing sources from radarek

13. Thanks for listening