#Day 21 Monkey Math

17 messages · Page 1 of 1 (latest)

lean cloud
umbral lance
#

oh man so close. would have been top 100 if || i had done the smart thing immediately instead of trying to brut force it. ||

lean cloud
#

Today kind of looks like what people say prolog would be good at

lone marsh
#

good old eval and lave

#

and i agree it's very backprop, but afaik you'd want prolog with a constraint extension

#

mostly just because my gut instinct is to reach for a constraint solver though it's overkill

#

i just ended up just writing the obvious evaluator

prisma linden
#

I did part 1 "properly"
Then I made a working AOT compiled version to try to brute force part 2... and it doesn't work deepfried

#

Maybe I need to check a wider range than ±2^32

prisma linden
#

updating my GPU drivers

#

glue Still gonna take 140ish hours to check ±2^53 on an RTX 2060

#

I knew I should've left my desktop on to remote into

prisma linden
#

thonking Well I got an answer quickly by going up from 0, but the site doesn't accept it.

prisma linden
#

They wanted the lowest one that gave the right answer
Yay race conditions

prisma linden
#

||oh lol, you can use binary search for the right answer||

lone marsh
#

Or you could calculate it directly by || rearranging the expression and solving for humn ||

lean cloud