mgrettondann/advent-of-code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
189 Commits 1 Branch 0 Tags
55902dc9b6263e46abbf7e78c10a27958f3a5f06
Commit Graph

189 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
mgrettondann 5d1edaa0a3 Add solution for 2022 day 18 2022-12-18 13:05:59 +00:00
mgrettondann 1c2074d074 Day 2022-16 tidied up. 2022-12-17 07:22:48 +00:00
mgrettondann 1f73a0f280 Initial solution for 2022 day 16. 2022-12-16 16:35:22 +00:00
mgrettondann 3627718a3e Tidy solution for 2022 day 15 part 2 x2. 2022-12-15 09:52:05 +00:00
mgrettondann ed02811d56 Tidy solution for 2022 day 15 part 2. 2022-12-15 09:46:52 +00:00
mgrettondann 026f2eba2c Add solutions for 2022 day 15. 2022-12-15 08:10:29 +00:00
mgrettondann 5d60304825 Add solutions for 2018 day 3. 2022-12-14 15:26:43 +00:00
mgrettondann 7c23c30cf6 Tidy up CMakeLists for includes. 2022-12-14 13:51:14 +00:00
mgrettondann 96f39f019e Add Puzzles for 2022 day 14 2022-12-14 08:59:32 +00:00
mgrettondann 9cad2da05d Add Puzzles for 2022 day 13 2022-12-13 13:01:44 +00:00
mgrettondann 5be1a0ad47 Add Puzzles for 2022 day 12 2022-12-12 07:51:51 +00:00
mgrettondann 54c9b00c96 Update CLion config 2022-12-11 08:49:05 +00:00
mgrettondann e384f5b571 Add puzzles for 2022 Day 11. 2022-12-11 07:47:51 +00:00
mgrettondann c9fa108996 Clang tidy 2022 Day 10. 2022-12-10 07:29:50 +00:00
mgrettondann 0e5e5b70d9 Clang tidy 2022 Day 9. 2022-12-09 07:17:55 +00:00
mgrettondann 04abe87471 Clang tidy 2022 Day 8. 2022-12-08 09:29:48 +00:00
mgrettondann bfd11cf480 Clang tidy 2022 Day 7. 2022-12-07 07:41:52 +00:00
mgrettondann 54900d5a36 Add 2022 Day 7. 2022-12-07 07:29:23 +00:00
mgrettondann d57308ea83 Add 2022 Day 6. 2022-12-06 10:51:17 +00:00
mgrettondann 0b06899b68 Add 2022 Day 5. 2022-12-05 07:35:09 +00:00
mgrettondann 3117a35581 Add 2022 Day 4. 2022-12-04 08:12:44 +00:00
mgrettondann 46b36d7ec8 Add 2022 Day 3. 2022-12-03 08:26:18 +00:00
mgrettondann 7005eb7ff4 Add 2022 Day 2. 2022-12-02 07:01:11 +00:00
mgrettondann 3c377b04db Add 2018 Day 2 part 2. 2022-12-01 19:10:00 +00:00
mgrettondann 24753f81d5 Add 2018 Day 2 Part 1 2022-12-01 17:36:53 +00:00
mgrettondann bc8ab51e99 Add 2022 Day 1 solutions 2022-12-01 07:02:12 +00:00
mgrettondann df9078ff37 Add 2021 Day 1 solutions 2022-11-27 17:22:43 +00:00
mgrettondann 931ad402fa Tidy 2021 25 solution 2022-11-27 17:22:29 +00:00
mgrettondann 29079b59bc Add Puzzle 2021-25-01 2022-11-26 21:34:03 +00:00
mgrettondann 4b275a855e Add Puzzle 2021-24 2022-11-26 21:10:00 +00:00
mgrettondann aae3bc7556 Merge remote-tracking branch 'origin/main' 2022-01-12 14:29:03 +00:00
mgrettondann 539666d508 Add 2017 puzzle 1 2022-01-12 14:28:19 +00:00
mgrettondann 0c2ac4d5f0 Add 2020 puzzle 1 2022-01-12 14:28:00 +00:00
mgrettondann 1fab8c9161 Completed puzzles for 2021 day 23 2022-01-12 14:26:21 +00:00
mgrettondann 3ba00ad3eb Separate out Dijkstra implementation 
This separates the Dijkstra implementation into its own generic function.

Whilst doing this we can simplify the code and also save yet more memory!

Still don't get correct results for part 2.
 2022-01-12 11:31:09 +00:00
mgrettondann a1a7d11583 Separate out Dijkstra implementation 
This separates the Dijkstra implementation into its own generic function.

Whilst doing this we can simplify the code and also save yet more memory!

Still don't get correct results for part 2.
 2022-01-12 09:30:21 +00:00
mgrettondann 29005ed7ba Improved version of 2021 puzzle 23-02 
Building on changes to part 1 see if this performs better and produces correct results.
 2021-12-25 08:58:21 +00:00
mgrettondann a5fc32ed07 Imrpove Puzzle 23-01 by modelling top row correctly. 
Previously we modelled the top row as a connected series of nodes and allowed them to connect to each other directly.  This ignored the rule that you have to move directly to the place you want on the top row and then back out of it.

However, that was fine as the lowest cost would imply that.  But it does slow down and give more states to consider.

Instead, model the nodes on the top row as being directly connected to the nodes in the second row.  Add some rules about when you can move from one to the other and use those.

This reduces the number of states we have to consider in total.  And hopefully speeds up the process.
 2021-12-24 12:34:00 +00:00
mgrettondann cca3a22a43 Proposed solutions for 2021 day 23 
Improve speed by using two sets for State management:

states: Contains all the states we need to visit indexed by state - Cost is ignored.
costs:  Contains all the states we need to visit indexed by cost then state.

This then means the lookup for the minimum cost is fast.
 2021-12-24 11:53:57 +00:00
mgrettondann b53002d48a Proposed solutions for 2021 day 23 2021-12-23 19:49:33 +00:00
mgrettondann fcfdcddd33 Add 2017 Day 25 puzzles 2021-12-22 16:36:30 +00:00
mgrettondann e06e78ce3c Add 2017 Day 24 puzzles 2021-12-22 15:57:06 +00:00
mgrettondann d1e6f5b086 Fix macOS builds 2021-12-22 15:19:53 +00:00
mgrettondann 997dad69b4 Add 2017 Day 23 puzzles 2021-12-22 15:17:21 +00:00
mgrettondann 3ae7eb86ac Add 2021 Day 22 puzzles 2021-12-22 09:46:52 +00:00
mgrettondann 0953533066 Add 2017 Day 22 puzzles 2021-12-21 15:28:12 +00:00
mgrettondann 7d0fb91103 Add 2017 Day 21 puzzles 2021-12-21 14:04:46 +00:00
mgrettondann 3e718e2aa0 Add 2017 Day 20 puzzle 2 2021-12-21 13:23:49 +00:00
mgrettondann 77811aa473 Add 2021 day 21 puzzles 2021-12-21 10:58:48 +00:00
mgrettondann 495222c63c Add 2021 day 20 puzzles 2021-12-20 07:46:43 +00:00