From 461791f158fa276b14a89f6c0e7dad5e73847a74 Mon Sep 17 00:00:00 2001 From: Matthew Butterick Date: Sat, 2 Jan 2016 13:21:05 -0800 Subject: [PATCH] tweak --- day13.scrbl | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/day13.scrbl b/day13.scrbl index b47ec47..3369b4b 100644 --- a/day13.scrbl +++ b/day13.scrbl @@ -19,7 +19,7 @@ Also, whereas a path between cities had a start and end, a seating arrangement i Those wrinkles noted, we'll proceed as we did in @secref{Day_9}. We'll parse the input data and put the happiness scores into a hash table. Then we'll loop through all possible seating arrangements with @racket[in-permutations] and see what the best score is. -@margin-note{Math jocks might note that because our seating arrangement is circular, our permutations will include a lot of ``rotationally equivalent'' arrangements — e.g., @racket['(A B C D)] is the same as @racket['(B C D A)] and @racket['(C D A B)]. If we had more people, or the happiness function were more expensive, we might want to prune out these equivalent arrangements as a performance optimization. But in this case, it's unnecessary.} +Math jocks might note that because our seating arrangement is circular, our permutations will include a lot of ``rotationally equivalent'' arrangements — e.g., @racket['(A B C D)] is the same as @racket['(B C D A)] and @racket['(C D A B)]. If we had more people, or the happiness function were more expensive, we might want to prune out these equivalent arrangements as a performance optimization. But in this case, it's unnecessary.