Wrap up of Advent of Code 2021 in pure TensorFlow
A wrap up of my solutions to the Advent of Code 2021 puzzles in pure TensorFlow
Advent of Code 2021 in pure TensorFlow - day 12
Day 12 problem projects us the world of graphs. TensorFlow can be used to work on graphs pretty easily since a graph can be represented as an adjacency matrix, and thus, we can have a tf.Tensor containing our graph. However, the "natural" way of exploring a graph is using recursion, and as we'll see in this article, this prevents us to solve the problem using a pure TensorFlow program, but we have to work only in eager mode.
Advent of Code 2021 in pure TensorFlow - day 11
The Day 11 problem has lots in common with Day 9. In fact, will re-use some computer vision concepts like the pixel neighborhood, and we'll be able to solve both parts in pure TensorFlow by using only a tf.queue as a support data structure.
Advent of Code 2021 in pure TensorFlow - day 10
The day 10 challenge projects us in the world of syntax checkers and autocomplete tools. In this article, we'll see how TensorFlow can be used as a generic programming language for implementing a toy syntax checker and autocomplete.