diff --git a/2022/README.md b/2022/README.md
index 256ce25ab2a8cf56ccc215a45f457d7dac057993..eb411f15324a06c29396608c4fff3df2e14988ad 100644
--- a/2022/README.md
+++ b/2022/README.md
@@ -566,47 +566,5 @@ Instead, we'll have to pretend there's an infinitely-long floor.
 
 ## Day 15
 
-- [The problem](https://adventofcode.com/2022/day/14)
-- [The solution](src/main/java/edu/unl/cse/bohn/year2022/Day14.java)
-
-### Part 1
-
-The subproblems are
-- Determine which locations are blocked
-- Determine where a unit of sand moves to
-  - Can it move?
-  - Down, diagonally left, diagonally right?
-- Determine the final status of a unit of sand
-  - Stationary, blocking a location
-  - Falling forever
-
-### Part 2
-
-Same subproblems, except that falling forever isn't an option.
-Instead, we'll have to pretend there's an infinitely-long floor.
-
-## Day 15
-
-- [The problem](https://adventofcode.com/2022/day/14)
-- [The solution](src/main/java/edu/unl/cse/bohn/year2022/Day14.java)
-
-### Part 1
-
-The subproblems are
-- Determine which locations are blocked
-- Determine where a unit of sand moves to
-  - Can it move?
-  - Down, diagonally left, diagonally right?
-- Determine the final status of a unit of sand
-  - Stationary, blocking a location
-  - Falling forever
-
-### Part 2
-
-Same subproblems, except that falling forever isn't an option.
-Instead, we'll have to pretend there's an infinitely-long floor.
-
-## Day 15
-
 (coming soon)