magical 910da239c0 new A* optimization: worst-case pruning ... i'm not sure if this has been described in the literature exactly but it is similar to existing branch-and-bound techniques. it doesn't speed up the search directly (the number of visited nodes is the same) but it does cut the queue length down by an order of magnitude and shave a couple seconds off of day 16, presumably due to reduced memory pressure or something.		2022-12-17 20:15:25 -08:00
day01	day 1 pure awk solution	2022-12-01 18:21:46 -08:00
day02	day 2 ivy solution	2022-12-01 22:26:23 -08:00
day03	day 3 ivy solution	2022-12-03 00:41:36 -08:00
day04	add some comments	2022-12-04 22:10:16 -08:00
day05	day 5 awk swap part one and two, oops	2022-12-07 12:17:58 -08:00
day06	day 6 simplify ivy solution and fix an off-by-n bug	2022-12-06 22:42:02 -08:00
day07	day 7 simplify awk solution	2022-12-06 22:42:02 -08:00
day08	day 8 ivy part 2 cleanup	2022-12-11 18:21:07 -08:00
day09	day 9 python simplify	2022-12-08 21:44:02 -08:00
day10	day 10 ivy tweak	2022-12-10 11:52:08 -08:00
day11	day 11 python slight optimization	2022-12-10 23:48:39 -08:00
day12	add astar module and alternate solution for day 12	2022-12-12 12:55:37 -08:00
day13	day 13 python cleanup	2022-12-13 10:39:36 -08:00
day14	day 14 python more cleanup	2022-12-14 01:02:53 -08:00
day15	day 15 svg visualization	2022-12-17 16:36:01 -08:00
day16	new A* optimization: worst-case pruning	2022-12-17 20:15:25 -08:00
day17	day 17 python tweaks	2022-12-17 13:31:57 -08:00
lib	new A* optimization: worst-case pruning	2022-12-17 20:15:25 -08:00
.gitignore	initial commit	2022-11-30 21:12:58 -08:00