From f6799dd691078bcf534a165fd05251a7e87101f3 Mon Sep 17 00:00:00 2001 From: efim Date: Sun, 25 Dec 2022 10:58:24 +0000 Subject: [PATCH] lets skip day 21 part 2! --- day21-scratch.lisp | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/day21-scratch.lisp b/day21-scratch.lisp index dd71da8..2758f97 100644 --- a/day21-scratch.lisp +++ b/day21-scratch.lisp @@ -55,3 +55,28 @@ (load-file-defs "day21-test.txt") (eval root) + +(load-file-defs "day21-input.txt") +(print (eval root)) + +;; now. things are different. +;; HUMN is my input +;; and ROOT is "comparison of two numbers" +;; and change in root can influence results in a significant way +;; so, how'd i do that? +;; +;; what could be done then? +;; i could potentially somehow modify the operations? +;; so that (eval humn) would return +;; +;; root: pppw + sjmn +;; so. root should mean +;; pppw == sjmn +;; don't know which has HUMN yet. +;; should i then just eval those that have HUMN into a operation? +;; and others into a number? +;; well, i suppose i'd need to do pass down somehow +;; eval both parts of the root. +;; and then what? +;; +;; let's skip for now?