diff --git a/meson.build b/meson.build
index 334988e..6e2a730 100644
--- a/meson.build
+++ b/meson.build
@@ -44,6 +44,7 @@ days = {
   'day10': [ 'src/day10/solve.c' ],
   'day11': [ 'src/day11/solve.c' ],
   'day12': [ 'src/day12/solve.c' ],
+  'day13': [ 'src/day13/solve.c' ],
   # XXX: marker
 }
 
diff --git a/puzzle/day13.md b/puzzle/day13.md
new file mode 100644
index 0000000..17fea15
--- /dev/null
+++ b/puzzle/day13.md
@@ -0,0 +1,138 @@
+
+--- Day 13: Point of Incidence ---
+
+With your help, the hot springs team locates an appropriate spring which launches you neatly and precisely up to the edge of Lava Island.
+
+There's just one problem: you don't see any lava.
+
+You do see a lot of ash and igneous rock; there are even what look like gray mountains scattered around. After a while, you make your way to a nearby cluster of mountains only to discover that
+the valley between them is completely full of large mirrors. Most of the mirrors seem to be aligned in a consistent way; perhaps you should head in that direction?
+
+As you move through the valley of mirrors, you find that several of them have fallen from the large metal frames keeping them in place. The mirrors are extremely flat and shiny, and many of
+the fallen mirrors have lodged into the ash at strange angles. Because the terrain is all one color, it's hard to tell where it's safe to walk or where you're about to run into a mirror.
+
+You note down the patterns of ash (.) and rocks (#) that you see as you walk (your puzzle input); perhaps by carefully analyzing these patterns, you can figure out where the mirrors are!
+
+For example:
+
+#.##..##.
+..#.##.#.
+##......#
+##......#
+..#.##.#.
+..##..##.
+#.#.##.#.
+
+#...##..#
+#....#..#
+..##..###
+#####.##.
+#####.##.
+..##..###
+#....#..#
+
+To find the reflection in each pattern, you need to find a perfect reflection across either a horizontal line between two rows or across a vertical line between two columns.
+
+In the first pattern, the reflection is across a vertical line between two columns; arrows on each of the two columns point at the line between the columns:
+
+123456789
+    ><   
+#.##..##.
+..#.##.#.
+##......#
+##......#
+..#.##.#.
+..##..##.
+#.#.##.#.
+    ><   
+123456789
+
+In this pattern, the line of reflection is the vertical line between columns 5 and 6. Because the vertical line is not perfectly in the middle of the pattern, part of the pattern (column 1)
+has nowhere to reflect onto and can be ignored; every other column has a reflected column within the pattern and must match exactly: column 2 matches column 9, column 3 matches 8, 4 matches 7,
+and 5 matches 6.
+
+The second pattern reflects across a horizontal line instead:
+
+1 #...##..# 1
+2 #....#..# 2
+3 ..##..### 3
+4v#####.##.v4
+5^#####.##.^5
+6 ..##..### 6
+7 #....#..# 7
+
+This pattern reflects across the horizontal line between rows 4 and 5. Row 1 would reflect with a hypothetical row 8, but since that's not in the pattern, row 1 doesn't need to match anything.
+The remaining rows match: row 2 matches row 7, row 3 matches row 6, and row 4 matches row 5.
+
+To summarize your pattern notes, add up the number of columns to the left of each vertical line of reflection; to that, also add 100 multiplied by the number of rows above each horizontal line
+of reflection. In the above example, the first pattern's vertical line has 5 columns to its left and the second pattern's horizontal line has 4 rows above it, a total of 405.
+
+Find the line of reflection in each of the patterns in your notes. What number do you get after summarizing all of your notes?
+
+Your puzzle answer was 35210.
+
+The first half of this puzzle is complete! It provides one gold star: *
+
+--- Part Two ---
+
+You resume walking through the valley of mirrors and - SMACK! - run directly into one. Hopefully nobody was watching, because that must have been pretty embarrassing.
+
+Upon closer inspection, you discover that every mirror has exactly one smudge: exactly one . or # should be the opposite type.
+
+In each pattern, you'll need to locate and fix the smudge that causes a different reflection line to be valid. (The old reflection line won't necessarily continue being valid after the smudge
+is fixed.)
+
+Here's the above example again:
+
+#.##..##.
+..#.##.#.
+##......#
+##......#
+..#.##.#.
+..##..##.
+#.#.##.#.
+
+#...##..#
+#....#..#
+..##..###
+#####.##.
+#####.##.
+..##..###
+#....#..#
+
+The first pattern's smudge is in the top-left corner. If the top-left # were instead ., it would have a different, horizontal line of reflection:
+
+1 ..##..##. 1
+2 ..#.##.#. 2
+3v##......#v3
+4^##......#^4
+5 ..#.##.#. 5
+6 ..##..##. 6
+7 #.#.##.#. 7
+
+With the smudge in the top-left corner repaired, a new horizontal line of reflection between rows 3 and 4 now exists. Row 7 has no corresponding reflected row and can be ignored, but every
+other row matches exactly: row 1 matches row 6, row 2 matches row 5, and row 3 matches row 4.
+
+In the second pattern, the smudge can be fixed by changing the fifth symbol on row 2 from . to #:
+
+1v#...##..#v1
+2^#...##..#^2
+3 ..##..### 3
+4 #####.##. 4
+5 #####.##. 5
+6 ..##..### 6
+7 #....#..# 7
+
+Now, the pattern has a different horizontal line of reflection between rows 1 and 2.
+
+Summarize your notes as before, but instead use the new different reflection lines. In this example, the first pattern's new horizontal line has 3 rows above it and the second pattern's new
+horizontal line has 1 row above it, summarizing to the value 400.
+
+In each pattern, fix the smudge and find the different line of reflection. What number do you get after summarizing the new reflection line in each pattern in your notes?
+
+Answer:
+
+Although it hasn't changed, you can still get your puzzle input.
+
+You can also [Shareon Twitter Mastodon] this puzzle.
+
diff --git a/src/day13/solve.c b/src/day13/solve.c
new file mode 100644
index 0000000..ebe70c0
--- /dev/null
+++ b/src/day13/solve.c
@@ -0,0 +1,114 @@
+/*
+ * Author: Michael Adler
+ *
+ * Copyright: 2023 Michael Adler
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ */
+
+#include "solve.h"
+#include "aoc/all.h"
+
+#define MAX_ROWS 32
+#define MAX_COLS 32
+
+#define ASH '.'
+#define ROCK '#'
+
+typedef struct {
+    char data[MAX_ROWS][MAX_COLS];
+    int rows;
+    int cols;
+} grid_t;
+
+/*
+static void print_grid(const grid_t *grid) {
+    for (int y = 0; y < grid->rows; y++) {
+        for (int x = 0; x < grid->cols; x++) { printf("%c", grid->data[y][x]); }
+        puts("");
+    }
+}
+*/
+
+static bool is_perfect_vertical(const grid_t *grid, int x) {
+    // x denotes the position of the > in ><
+    int delta = 0;
+    while (1) {
+        int x_left = x - delta;
+        int x_right = x + 1 + delta;
+        if (x_left < 0 || x_right >= grid->cols) break;
+        // compare columns
+        for (int y = 0; y < grid->rows; y++) {
+            if (grid->data[y][x_left] != grid->data[y][x_right]) return false;
+        }
+        delta++;
+    }
+    return true;
+}
+
+static bool is_perfect_horizontal(const grid_t *grid, int y) {
+    // y denotes the position of the v
+    int delta = 0;
+    while (1) {
+        int y_top = y - delta;
+        int y_down = y + 1 + delta;
+        if (y_top < 0 || y_down >= grid->rows) break;
+        // compare rows
+        for (int x = 0; x < grid->cols; x++) {
+            if (grid->data[y_top][x] != grid->data[y_down][x]) return false;
+        }
+        delta++;
+    }
+    return true;
+}
+
+void solve(const char *buf, size_t buf_size, Solution *result) {
+    i64 part1 = 0, part2 = 0;
+    size_t pos = 0;
+
+    while (pos < buf_size) {
+        grid_t grid = {0};
+        while (1) {
+            int x = 0;
+            while (buf[pos] != '\n') { grid.data[grid.rows][x++] = buf[pos++]; }
+            grid.rows++;
+            grid.cols = x;
+            pos++; // newline
+            if (pos >= buf_size || buf[pos] == '\n') {
+                // current pattern is over
+                pos++;
+                break;
+            }
+        }
+        log_debug(">> grid has %d rows, %d cols", grid.rows, grid.cols);
+
+        for (int x = 0; x < grid.cols - 1; x++) {
+            if (is_perfect_vertical(&grid, x)) {
+                int col = x + 1;
+                log_debug("found perfect vertical reflection between %d and %d", col, col + 1);
+                part1 += col;
+            }
+        }
+        for (int y = 0; y < grid.rows - 1; y++) {
+            if (is_perfect_horizontal(&grid, y)) {
+                int row = y + 1;
+                log_debug("found perfect horizontal reflection between %d and %d", row, row + 1);
+                part1 += 100 * row;
+            }
+        }
+    }
+
+    snprintf(result->part1, sizeof(result->part1), "%ld", part1);
+    snprintf(result->part2, sizeof(result->part2), "%ld", part2);
+}
+
+int solve_input(const char *fname, Solution *result) {
+    char buf[1 << 15];
+    int n = aoc_io_read_input(fname, buf, sizeof(buf));
+    if (n <= 0) {
+        fprintf(stderr, "Failed to read %s\n", fname);
+        return -1;
+    }
+    solve(buf, n, result);
+    return 0;
+}
diff --git a/src/day13/solve_test.c b/src/day13/solve_test.c
new file mode 100644
index 0000000..c492c61
--- /dev/null
+++ b/src/day13/solve_test.c
@@ -0,0 +1,45 @@
+/*
+ * Author: Michael Adler
+ *
+ * Copyright: 2023 Michael Adler
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ */
+
+#define CTEST_MAIN
+
+#include "ctest.h"
+#include "solve.h"
+
+CTEST(day13, example) {
+    const char *buf = "#.##..##.\n\
+..#.##.#.\n\
+##......#\n\
+##......#\n\
+..#.##.#.\n\
+..##..##.\n\
+#.#.##.#.\n\
+\n\
+#...##..#\n\
+#....#..#\n\
+..##..###\n\
+#####.##.\n\
+#####.##.\n\
+..##..###\n\
+#....#..#\n";
+    Solution solution;
+    solve(buf, strlen(buf), &solution);
+    ASSERT_STR("405", solution.part1);
+    // ASSERT_STR("0", solution.part2);
+}
+
+#ifdef HAVE_INPUTS
+CTEST(day13, real) {
+    Solution solution;
+    solve_input("input/" DAY ".txt", &solution);
+    ASSERT_STR("35210", solution.part1);
+    // ASSERT_STR("0", solution.part2);
+}
+#endif
+
+int main(int argc, const char *argv[]) { return ctest_main(argc, argv); }