Advent of Code 2023

[Nivethan T]

The Advent of Code (It's a coding puzzle each day until Christmas) is going to be starting up and I think it might be fun to do it in Pick.

I'll post my answers in this thread and hopefully we can get a group going here. :)

[Nivethan T]

Forgot to link the site, sorry!

https://adventofcode.com

You will need to log in with one of the following:

[GitHub] [Google] [Twitter] [Reddit]

[Nivethan T]

Day 1 has started!

My own answer:

https://github.com/Krowemoh/AOC-2023

I like using the multivalue aware functions like OCONVS and LENS.

Part 2 has a trick so if you get stuck you can check the subreddit or post here.

https://www.reddit.com/r/adventofcode/

[Optimus01010101]

Thanks for the tip in your code. I didn't get the second part without the help.

For day 2, I did get both parts. Like you, I love OCONV, but I also love CHANGE

Here is my solution: https://github.com/ewm76903/2023_AOC_PICKBASIC

[Nivethan T]

Here is day 2 :)

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.2

I would have liked to have used something like MAXIMUM to find the max of each multivalue set. Similar to how we have MULS to multiply 2 multivalue lists together.

I also have a feeling part 1 could have been done using a FILE and maybe doing a select though I'm having trouble thinking it through.

Might be a fun challenge for someone to try and do these challenges with just the database and SELECTs!

[Nivethan T]

Day 3!

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.3

This is all about adjacency checking on a board. Bit of a pain to write out all the code.

Weekend puzzles are usually harder so things should get a bit easier tomorrow. (hopefully)

[Optimus01010101]

Well Niventhan, you solution is much more elegent than mine. I should have thought along the lines you did, but alas I did not.

Despite the bruttish way I did it, I did solve both parts.

Here's mine: https://github.com/ewm76903/2023_AOC_PICKBASIC/DAY_3

[Nivethan T]

The link 404s so here is another link :)

https://github.com/ewm76903/2023_AOC_PICKBASIC/blob/main/DAY_3

If it works, it works! 

I'm glad someone else is doing this as well. Having a varied corpus of BASIC will be handy for someone in the future.

[Nivethan T]

Day 4 was definitely an easier one.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.4

Depending on your implementation part 2 could take awhile to run if things are inefficient.

[Optimus01010101]

sorry about that. But, it's day 4, so I need to get started. ;)

[Optimus01010101]

Well Nivethan, logic wise, it seems that we are both on the same page for both parts of the puzzle.

My code is the same number of lines, but I straight lined it, while you uses of GOSUBS works as well.

One difference, I prefer dynamic arrays for a puzzle like this. I only use dimension arrays, when I need them to hold something like records or even file pointers. It just seems easier.

Also, I'm working on a system with QM. So I don't know if the functionality of TRIM is the same on other DB's?

Well, here is my code: https://github.com/ewm76903/2023_AOC_PICKBASIC/blob/main/DAY_4

[Nivethan T]

Well Day 5 was a mission.

Part 1 wasn't too bad though this was the first puzzle I had to really sit down and map.

I haven't finished part 2 as the brute force answer was taking too long. Even after letting it run for 8 hours! (I'll post a link to my answer once I give up/get the answer)

Some tips and hints at:

https://old.reddit.com/r/adventofcode/comments/18b51h9/2023_day_5_part_2_my_computer_running_the_brutal/

[Nivethan T]

Day 5, Part 1 only - I had hoped to last longer but I might be doing just part 1 puzzles from now on :(

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.5

[Nivethan T]

Day 6 is thankfully much easier.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.6

A little bit of math goes a long way here though other people were able to bruteforce the answer. It was taking too long for BASIC I think.

[Optimus01010101]

Yeah, day 6 is magnitudes easier than day 5 part 2. I just gave up on that one.

I will say, my part 2 does sort of brute force, but it is under a minute on my system. However, Nivethan, you solution for part 2, again, puts me to shame.

This just validates what I've always said about PICK Basic: "There are an unlimited ways to code a program to skin a cat in PICK Basic"

Well, here is my code: https://github.com/ewm76903/2023_AOC_PICKBASIC/blob/main/DAY_6

[Optimus01010101]

Ok, I guess I'm first with posting that I got both parts of DAY 7's puzzle.

Based on Reddit post, I had to use a different test data set than what was given in the AoC puzzle. This was b/c the data set was two small, and did not take into account what is called "edge cases", like determining if the hand is a full house.

Either way, here's my code: https://github.com/ewm76903/2023_AOC_PICKBASIC/blob/main/DAY_7

[Nivethan T]

I had a busy Thursday and so missed AOC 7 but! I did finish up 8 now.

Part 1 is straightforward but I cheated for Part 2 and got hints from reddit. I was able to solve it but I'm not convinced why the logic results in being able to solve the puzzle. It feels like there should be more.

I'll need to watch a video or something to see why the logic works.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.8

Hopefully I'll be able to get some time over the weekend to catch up on  AOC 7.

[Nivethan T]

Day 9 is a fun one.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.9

The further I get from Day7  the more daunting it feels.

I swear there is a function that will generate a dynamic array of strings but I can seem to find it.

XS("0",3) would generate 0b0b0 (3 0s with attribute marks)

[Nivethan T]

Day 7 might be my favorite day so far.

I'm pretty happy with my solution of simplifying the part 1 answer and then the part 2 answer falls out nicely. I think this could be cleaned up some more. I also ran headfirst into a mess because I was sorting the hands into real poker hands instead of breaking the ties in the order the hands started in.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.7

[Nivethan T]

Day 10 was a tough on that involved mapping. This is probably my least favourite day so far as it ate up quite a bit of my time.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.10

Day 11 was all about shortest paths and this was a fun one to work out. I didn't math it out until part 2 but I'm pretty happy with how simple it got. I'm sure there's a trick that would blow this thing wide open.

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.11

[Optimus01010101]

It's been a couple of days, so I just went ahead and went with today's puzzle.

I'm wondering if those who put it together, were thinking about PICK. I got done in under an hour.

Here's my code: https://github.com/ewm76903/2023_AOC_PICKBASIC/blob/main/DAY_15

[Nivethan T]

Good to see you!

It's the busy season so I'll stick to the easier puzzles.

Day 14

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.14

Day 15 was a quick one

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.15

it looks like we hit the same pattern.

[Nivethan T]

Day 16

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.16

I actually let the loop go forever and waited until the answer stabilized. I didn't figure out how to exit once the answer was found lool.

[Nivethan T]

Day 19 Part 1

https://github.com/Krowemoh/AOC-2023/blob/main/AOC.PUZZLE.19

A bit of a mess, I wrote this without planning anything through.