Andrew Fribush
fig. 1.1.15 · trick-or-treat routes: five planners race one random suburb, home by curfew.
16/35 MIN · CANDY/MIN: 16 CANDY NOWNEW NEIGHBOURHOOD·GO >·PICK HOUSES TO PLANCANDY:BAR 10FUN 5LOLLY 3RAISIN 1OFF 0HOMERAISINS · 1 CANDYARRIVE AT 27 MINCANDY015300CLICK A NAMEFINAL HAUL35 MINANNEALING23EXACT232-OPT18CANDY/MIN17NEAREST7STEP THROUGH CANDY/MIN ›BEST POSSIBLE: 23 CANDY · 249 ROUTES CHECKED

16/35 MIN · CANDY/MIN: 16 CANDY NOW

source: generated: a seeded suburb (TrickOrTreat.town.ts), routes planned by TrickOrTreat.algos.ts

View in context: Home → · All figures

Andrew Fribush, software and computer engineer in Austin. I build consequential systems where software meets institutions: finance, healthcare, commerce, government data, and the mechanisms that govern AI agents. Taking new engagements: hello@andrewfribush.com.