Commit Graph

241 Commits

Author SHA1 Message Date
79428d6192 day23: final version (could add priority queue to improve further ?) 2022-09-14 20:02:54 +02:00
ebb8a0d738 day 25: memory cleanup, simplify puzzle input read 2022-09-14 19:56:33 +02:00
721f9da54e day 25: code cleanup 2022-09-08 21:08:49 +02:00
5da5adb8bf day 25: simplify code. 2022-09-08 16:11:29 +02:00
adb8fc6b95 day 25, first version (need lots of cleaning) 2022-09-07 22:14:45 +02:00
4dbcc30dc3 first try of A* move sorting 2022-04-05 13:20:13 +02:00
49bbc2372c changes in newmove() & hash() to avoid code duplication 2022-04-04 16:46:51 +02:00
aa0f475b17 messy/bloaty/slow version working for example & input 2022-04-02 17:35:39 +02:00
9a0d7a2ca7 temp save to use on laptop 2022-04-01 06:37:55 +02:00
ea429a99a7 Day 23: zobrist hash, still wrong collisions (works only without hash) 2022-03-30 21:39:16 +02:00
4fa4a5d366 day23: 1st "running" version, which does not work (maybe hash issue) 2022-03-30 13:20:11 +02:00
e25d79e95b bits.c: added 32 bits versions (untested) 2022-03-30 13:19:38 +02:00
4be7c56b88 day 24 parts 1 & 2 (forgot source) 2022-03-30 13:19:02 +02:00
c78a3e7285 Day 23 part 2 README (part 1 done with pen/paper) 2022-03-26 16:49:27 +01:00
f807acc983 day 24 2022-03-25 16:08:54 +01:00
b64bc6c1d5 update library from mainstream, especially {READ,WRITE}_ONCE 2022-03-24 18:42:35 +01:00
6aa605a0de init days{24,25} 2022-03-24 18:41:28 +01:00
1f835c10c5 new list.h with {READ,WRITE}_ONCE 2022-03-18 17:25:39 +01:00
d4ec54ed5b add #error for word size != 64 2022-02-07 18:18:11 +01:00
4ac39e5a69 day 23: early code for bitboard approach. 2022-01-29 21:00:54 +01:00
b8e61bcacb day 22: typo in day # comment 2022-01-29 21:00:31 +01:00
efb25f363f bugfix bit_for_each64_2 2022-01-29 15:47:38 +01:00
1e8556b5d5 day 23 init 2022-01-28 19:37:23 +01:00
5c392199fe Day 22 : clean code, more comments. 2022-01-28 17:07:44 +01:00
6b753e9d6c day 22: working part 2. Two days lost due to int overflow :-( 2022-01-28 16:08:05 +01:00
35053f3c8c day 22: change part1 to match part2 changes in input read. 2022-01-27 19:10:36 +01:00
97411fbb08 day 22 part 1 (basic/stupid algorithm, not suitable for part 2) 2022-01-27 16:24:43 +01:00
ecbeffc3d9 Day 22 init 2022-01-25 13:47:18 +01:00
7082ce3565 day 21: fix memory leaks 2022-01-25 13:46:48 +01:00
58027905b8 day 21 part2, 1st version. Need improvement in queue management (!) 2022-01-24 15:49:02 +01:00
76bd022049 day 21 part 1 2022-01-24 00:12:13 +01:00
cf2bed124e day 21 init 2022-01-23 21:58:17 +01:00
dacefcd5ad day20: final version (more comments, more code cleanup) 2022-01-23 21:48:18 +01:00
db7013309b day20 EXAMPLE2.txt: impossible input 2022-01-23 21:47:46 +01:00
63e737b863 day 20: code cleanup 2022-01-23 20:50:51 +01:00
f1af70e55a Added example file to resolve both parts with initial '#' 2022-01-23 20:45:16 +01:00
ec4684a756 day 20, part 2 (before code cleanup) 2022-01-23 20:44:28 +01:00
897453fb39 day 20: working version for part 1 2022-01-23 20:38:58 +01:00
81cfe12d67 day20, part1: working version for given example (not for input) 2022-01-23 20:27:52 +01:00
640feea875 day 20 init 2022-01-22 20:42:38 +01:00
2692f3f621 day19: cosmetic changes 2022-01-22 20:18:15 +01:00
5346b0e7fa day 19, after optimization (8.5s -> 0.06s) 2022-01-22 19:37:25 +01:00
c84a37874c day 19: clean logs 2022-01-22 15:05:23 +01:00
b11c35be26 day 19 part 2, before cleaning 2022-01-22 14:01:13 +01:00
858258770b day 19 part 1 (ugly, many useless code) 2022-01-22 13:22:39 +01:00
1caa102c23 day19: move beacons/distances from arrays to lists 2022-01-21 16:54:15 +01:00
9fd980c71b day 19: save before reverting scanners's beacons/distances to linked lists 2022-01-19 17:23:26 +01:00
6c3672f8d1 (temp) save not working day19 - likely mismatch in scanners ref array 2022-01-16 21:16:21 +01:00
96c9f7d6e3 pool_create: do not fail if structure is too small to handle list pointers 2022-01-16 21:07:30 +01:00
fe4520da7f list.h: blank line 2022-01-16 21:00:16 +01:00