mbutterick
/
aoc-racket
Archived
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

note

Browse Source
master-blaster
Matthew Butterick 9 years ago
parent 5d300ae8d9
commit d37adca51e
1 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File

10
day13.rkt
Unescape Escape View File

@ -74,7 +74,7 @@ How? By only looking at arrangements starting with a particular name. Doesn't ma
@section{What's the optimal happiness score, including ourself in the seating?} @section{What's the optimal happiness score, including ourself in the seating?}
We can reuse our hash table of @racket[happiness-scores], but we have to update it with scores for ourself seated next to every other person, which in every case is @racket[0]. Then we find the optimal score the same way. We can reuse our hash table of @racket[happiness-scores], but we have to update it with scores for ourself seated next to every other person, which in every case is @racket[0]. (The meaning of @racket[(in-list (list list (compose1 reverse list)))] is a small puzzle I leave for you.) Then we find the optimal score the same way.
@chunk[<day13-q2> @chunk[<day13-q2>
@ -82,11 +82,9 @@ We can reuse our hash table of @racket[happiness-scores], but we have to update
(define names (define names
(remove-duplicates (flatten (hash-keys happiness-scores)))) (remove-duplicates (flatten (hash-keys happiness-scores))))
(for ([name (in-list names)]) (for* ([name (in-list names)]
(define me-duo (list "me" name)) [proc (in-list (list list (compose1 reverse list)))])
(hash-set*! happiness-scores (hash-set! happiness-scores (proc "me" name) 0))
me-duo 0
(reverse me-duo) 0))
(define table-arrangement-scores (define table-arrangement-scores
(for/list ([partial-table-arrangement (in-permutations names)]) (for/list ([partial-table-arrangement (in-permutations names)])