diff --git a/2020/rgbctf/picking-pieces/README.md b/2020/rgbctf/picking-pieces/README.md
index f37c32c..2e4e527 100644
--- a/2020/rgbctf/picking-pieces/README.md
+++ b/2020/rgbctf/picking-pieces/README.md
@@ -22,7 +22,7 @@ provided file: <map.txt>
 consider the intersections and roads to be a (weighted) graph and use dijkstra's algorithm to find
 the shortest path. here is a solution in racket (because racket is good and you should use it)
 
-```racket
+```scheme
 #lang racket
 
 (require graph)