MIME-Version: 1.0
References: <CAEDh4nzEm2e=yFnC3UWjMVknjMvHsSX0nVtYdVZJK9NAMMaKVg@mail.gmail.com>
 <CAKAnmm+vumTRt8WB0OLsy7cVbYqdPW1m1EEOT26MCFPUd0JcOg@mail.gmail.com>
In-Reply-To: <CAKAnmm+vumTRt8WB0OLsy7cVbYqdPW1m1EEOT26MCFPUd0JcOg@mail.gmail.com>
From: Bernice Southey <bernice.southey@gmail.com>
Date: Tue, 16 Dec 2025 12:59:02 +0000
Message-ID: <CAEDh4nxpTobNoV8=6hqJm3gP2i6-=RvD9R9d1zh=6VrOta3gSA@mail.gmail.com>
Subject: Re: Advent of Code Day 8
To: Greg Sabino Mullane <htamfids@gmail.com>
Cc: pgsql-general@lists.postgresql.org
Content-Type: text/plain; charset="UTF-8"
Archived-At: <https://www.postgresql.org/message-id/CAEDh4nxpTobNoV8%3D6hqJm3gP2i6-%3DRvD9R9d1zh%3D6VrOta3gSA%40mail.gmail.com>
Precedence: bulk

Greg Sabino Mullane <htamfids@gmail.com> wrote:
> What's so wrong with brute force? :)
Yeah, a few more days of AoC changed my mind.

> In case it helps, here is my solution:
Thank you, this is very clever! I tried something similar, but with
updating the circuit in my table on every loop. It ran a couple of
minutes just to target the earliest possible full circuit for part 2.
This turned out to be the answer, but hardly satisfying. Your array
variables trick would never have occurred to me.

I found a couple of other interesting ideas on reddit. One used a
recursive function in a recursive cte, and another used hstore to
track unique boxes.

Good luck with day 10 part 2. That's the only one I gave up on after
discovering everyone was using solvers, or rolling their own. It's by
far the hardest, but one person found a brilliant way...don't forget
about part 1.

Thanks, Bernice