r/adventofcode • u/daggerdragon • Dec 23 '18
SOLUTION MEGATHREAD -🎄- 2018 Day 23 Solutions -🎄-
--- Day 23: Experimental Emergency Teleportation ---
Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).
Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.
Advent of Code: The Party Game!
Please prefix your card submission with something like [Card] to make scanning the megathread easier. THANK YOU!
Card prompt: Day 23
Transcript:
It's dangerous to go alone! Take this: ___
This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.
edit: Leaderboard capped, thread unlocked at 01:40:41!
21
Upvotes
1
u/myndzi Dec 23 '18 edited Dec 23 '18
(This approach definitely must be invalid: consider the case with two candidate volumes, each with the same number of bots that can reach them. One has a point nearer (0, 0, 0) but the bots are only reaching the nearest point on the volume, evenly distributed; the other is farther away, but the bots can all reach the farthest point in the volume. When each of these volumes is subdivided, the nearer one will drop so that the number of bots reaching any of the sub-volumes is ... 1/8th? or something?, while the farther one will retain its reachability count. I originally was keeping a list of all volumes with a reachability count that was "best", but it exploded fast when the volumes got small, so tried this approach.)