add day 20 #13

Merged
xuu merged 5 commits from day20 into main 2023-12-26 13:03:01 -07:00
2 changed files with 46 additions and 143 deletions
Showing only changes of commit 761013df81 - Show all commits

View File

@ -4,7 +4,6 @@ import (
"bufio" "bufio"
_ "embed" _ "embed"
"fmt" "fmt"
"os"
"strings" "strings"
aoc "go.sour.is/advent-of-code" aoc "go.sour.is/advent-of-code"
@ -23,16 +22,9 @@ type result struct {
func (r result) String() string { return fmt.Sprintf("%#v", r) } func (r result) String() string { return fmt.Sprintf("%#v", r) }
func run(scan *bufio.Scanner) (*result, error) { func run(scan *bufio.Scanner) (*result, error) {
var forever bool
if os.Getenv("AOC_FOREVER") == "1" {
forever = true
}
m := &machine{} m := &machine{}
receivers := make(map[string][]string) receivers := make(map[string][]string)
m.Add("rx", &rx{})
for scan.Scan() { for scan.Scan() {
text := scan.Text() text := scan.Text()
@ -48,72 +40,46 @@ func run(scan *bufio.Scanner) (*result, error) {
case strings.HasPrefix(name, "&"): case strings.HasPrefix(name, "&"):
name = strings.TrimPrefix(name, "&") name = strings.TrimPrefix(name, "&")
m.Add(name, &conjuction{name: name, dest: dest}) m.Add(name, &conjunction{name: name, dest: dest})
} }
for _, d := range dest { for _, d := range dest {
// rx is present so enable pt 2
if d == "rx" {
m.Add("rx", &rx{})
}
receivers[d] = append(receivers[d], name) receivers[d] = append(receivers[d], name)
} }
} }
m.Setup(receivers) m.setup(receivers)
result := &result{} result := &result{}
if forever { for i := 0; i < 10_000; i++ { // need enough presses to find the best LCM values for each conjunction
i := 0
defer func() {
if p := recover(); p != nil {
fmt.Printf("## Press %d FINISH %v ##", i, p)
os.Exit(1)
}
}()
for {
if i%12345 == 0 {
fmt.Printf("## Press %d ##\r", i)
}
m.Push(i)
i++
}
}
for i := 0; i < 4_0000; i++ {
// fmt.Printf("\n## Press %d ##\n\n", i)
if i == 1000 { if i == 1000 {
result.valuePT1 = m.highPulses * m.lowPulses result.valuePT1 = m.highPulses * m.lowPulses
} }
m.Push(i) m.Push(i)
} }
// fmt.Println("\n## SUMMARY ##") // rx is present.. perform part 2.
// fmt.Println("Sent", LOW, m.lowPulses) if rx, ok := receivers["rx"]; ok {
// fmt.Println("Sent", HIGH, m.highPulses) tip := m.m[rx[0]].(*conjunction) // panic if missing!
var lvalues []int var lvalues []int
for k, v := range tip.pushes {
for _, p := range m.m {
if p, ok := p.(*conjuction); ok && in(p.name, []string{"bk","tp","pt","vd"}) {
var values []int
for k, v := range p.pushes {
for i, h := range makeHistory(v) { for i, h := range makeHistory(v) {
if i == 1 && len(h) > 3 && h[0] > 0 { //&& all(h[0], h[1:]...) { if i == 1 && len(h) > 0 && h[0] > 0 {
fmt.Println(p.name, k, i, h[0]) fmt.Println(tip.name, k, "frequency", h[0])
values = append(values, h[0]) lvalues = append(lvalues, h[0])
} }
} }
} }
max := aoc.Max(values[0], values...)
fmt.Println(p.name, "MAX", max, values)
lvalues = append(lvalues, max)
}
}
result.valuePT2 = aoc.LCM(lvalues...) result.valuePT2 = aoc.LCM(lvalues...)
fmt.Println("tg", "LCM", result.valuePT2, lvalues) fmt.Println(tip.name, "LCM", result.valuePT2, lvalues)
}
// trace("rx", receivers)
return result, nil return result, nil
} }
@ -124,36 +90,17 @@ const (
HIGH signal = true HIGH signal = true
) )
func (m signal) String() string {
if m {
return " >>-HIGH-> "
}
return " >>-LOW-> "
}
type message struct { type message struct {
signal signal
from, to string from, to string
} }
func (m message) String() string {
return fmt.Sprint(m.from, m.signal, m.to)
}
type pulser interface {
Pulse(message)
SetMachine(*machine)
}
type machine struct { type machine struct {
m map[string]pulser m map[string]pulser
press int
queue []message queue []message
hwm int
stop bool
press int
highPulses int highPulses int
lowPulses int lowPulses int
} }
@ -176,13 +123,11 @@ func (m *machine) Send(msgs ...message) {
} }
} }
} }
func (m *machine) Push(i int) { func (m *machine) Push(i int) {
m.press = i m.press = i
m.Send(generate(LOW, "button", "broadcaster")...) m.Send(generate(LOW, "button", "broadcaster")...)
m.processQueue(i) m.processQueue(i)
} }
func (m *machine) processQueue(i int) { func (m *machine) processQueue(i int) {
// look for work and process up to the queue length. repeat. // look for work and process up to the queue length. repeat.
hwm := 0 hwm := 0
@ -204,7 +149,7 @@ func (m *machine) processQueue(i int) {
// fmt.Println("") // fmt.Println("")
} }
} }
func (m *machine) Setup(receivers map[string][]string) { func (m *machine) setup(receivers map[string][]string) {
for name, recv := range receivers { for name, recv := range receivers {
if p, ok := m.m[name]; ok { if p, ok := m.m[name]; ok {
if p, ok := p.(interface{ Receive(...string) }); ok { if p, ok := p.(interface{ Receive(...string) }); ok {
@ -214,10 +159,12 @@ func (m *machine) Setup(receivers map[string][]string) {
} }
} }
func (m *machine) Stop() { type pulser interface {
m.stop = true Pulse(message)
SetMachine(*machine)
} }
// IsModule implements the machine registration for each module.
type IsModule struct { type IsModule struct {
*machine *machine
} }
@ -232,7 +179,6 @@ type broadcaster struct {
func (b *broadcaster) Pulse(msg message) { func (b *broadcaster) Pulse(msg message) {
b.Send(generate(msg.signal, "broadcaster", b.dest...)...) b.Send(generate(msg.signal, "broadcaster", b.dest...)...)
} }
func (b *broadcaster) String() string { return "br" }
type flipflop struct { type flipflop struct {
name string name string
@ -248,70 +194,41 @@ func (b *flipflop) Pulse(msg message) {
b.Send(generate(b.state, b.name, b.dest...)...) b.Send(generate(b.state, b.name, b.dest...)...)
} }
} }
func (b *flipflop) String() string {
return fmt.Sprintf("%s(%v)", b.name, b.state)
}
type conjuction struct { type conjunction struct {
name string name string
state map[string]signal state map[string]signal
dest []string dest []string
pushes map[string][]int pushes map[string][]int
activate []int
last map[string]int
max map[string]int
lcm int
IsModule IsModule
} }
func (b *conjuction) Receive(names ...string) { func (b *conjunction) Receive(names ...string) {
if b.state == nil { if b.state == nil {
b.state = make(map[string]signal) b.state = make(map[string]signal)
b.last = make(map[string]int)
b.max = make(map[string]int)
b.pushes = make(map[string][]int) b.pushes = make(map[string][]int)
} }
for _, name := range names { for _, name := range names {
b.state[name] = false b.state[name] = false
b.max[name] = int(^uint(0)>>1)
b.pushes[name] = []int{} b.pushes[name] = []int{}
} }
} }
func (b *conjuction) Pulse(msg message) { func (b *conjunction) Pulse(msg message) {
if b.state == nil {
b.state = make(map[string]signal)
b.last = make(map[string]int)
b.max = make(map[string]int)
}
b.state[msg.from] = msg.signal b.state[msg.from] = msg.signal
if msg.signal { if msg.signal {
// collect frequency of pushes to esti,ate rate
b.pushes[msg.from] = append(b.pushes[msg.from], b.press) b.pushes[msg.from] = append(b.pushes[msg.from], b.press)
b.last[msg.from] = b.press - b.last[msg.from]
// vals := maps.Values(b.max)
// if aoc.Min(vals[0], vals...) != 0 {
// if lcm := aoc.LCM(vals...); lcm > 0 {
// fmt.Printf("\nfound loop %s = %d %v\n", b.name, lcm, vals)
// }
// }
} }
if all(HIGH, maps.Values(b.state)...) { if all(HIGH, maps.Values(b.state)...) {
b.activate = append(b.activate, b.press)
b.Send(generate(LOW, b.name, b.dest...)...) b.Send(generate(LOW, b.name, b.dest...)...)
return return
} }
b.Send(generate(HIGH, b.name, b.dest...)...) b.Send(generate(HIGH, b.name, b.dest...)...)
} }
func (b *conjuction) String() string {
return fmt.Sprintf("%s(%v)", b.name, b.state)
}
type rx struct { type rx struct {
IsModule IsModule
@ -319,16 +236,12 @@ type rx struct {
func (rx *rx) Pulse(msg message) { func (rx *rx) Pulse(msg message) {
if !msg.signal { if !msg.signal {
panic("pulse received") panic("pulse received") // will never happen...
} }
} }
func (rx *rx) String() string { return "rx" }
func all[T ~int|~bool](match T, lis ...T) bool {
if len(lis) == 0 {
return true
}
// helper funcs
func all[T comparable](match T, lis ...T) bool {
for _, b := range lis { for _, b := range lis {
if b != match { if b != match {
return false return false
@ -345,25 +258,15 @@ func generate(t signal, from string, destinations ...string) []message {
return msgs return msgs
} }
func in(n string, haystack []string) bool { // makeHistory from day 9
for _, h := range haystack {
if n == h {
return true
}
}
return false
}
func makeHistory(in []int) [][]int { func makeHistory(in []int) [][]int {
var history [][]int var history [][]int
history = append(history, in) history = append(history, in)
for { // for {
var diffs []int var diffs []int
current := history[len(history)-1] current := history[len(history)-1]
if len(current) == 0 { return nil }
for i := range current[1:] { for i := range current[1:] {
diffs = append(diffs, current[i+1]-current[i]) diffs = append(diffs, current[i+1]-current[i])
@ -371,9 +274,9 @@ func makeHistory(in []int) [][]int {
history = append(history, diffs) history = append(history, diffs)
if len(diffs) == 0 || aoc.Max(diffs[0], diffs[1:]...) == 0 && aoc.Min(diffs[0], diffs[1:]...) == 0 { // if len(diffs) == 0 || aoc.Max(diffs[0], diffs[1:]...) == 0 && aoc.Min(diffs[0], diffs[1:]...) == 0 {
break // break
} // }
} // }
return history return history
} }

View File

@ -52,5 +52,5 @@ func TestSolution(t *testing.T) {
t.Log(result) t.Log(result)
is.Equal(result.valuePT1, 819397964) is.Equal(result.valuePT1, 819397964)
is.Equal(result.valuePT2, 0) is.Equal(result.valuePT2, 252667369442479)
} }