Advent of code - day 2 part 1

[angrycaptain19]

For each day of the Advent of code we need to develop a solution for a 2 part problem.

For each day we should create a different folder in the parent directory that solves each part. We should also have a readme section for each day

Here is the problem for Day 2 Part 1:

--- Day 2: Cube Conundrum --- You're launched high into the atmosphere! The apex of your trajectory just barely reaches the surface of a large island floating in the sky. You gently land in a fluffy pile of leaves. It's quite cold, but you don't see much snow. An Elf runs over to greet you.

The Elf explains that you've arrived at Snow Island and apologizes for the lack of snow. He'll be happy to explain the situation, but it's a bit of a walk, so you have some time. They don't get many visitors up here; would you like to play a game in the meantime?

As you walk, the Elf shows you a small bag and some cubes which are either red, green, or blue. Each time you play this game, he will hide a secret number of cubes of each color in the bag, and your goal is to figure out information about the number of cubes.

To get information, once a bag has been loaded with cubes, the Elf will reach into the bag, grab a handful of random cubes, show them to you, and then put them back in the bag. He'll do this a few times per game.

You play several games and record the information from each game (your puzzle input). Each game is listed with its ID number (like the 11 in Game 11: ...) followed by a semicolon-separated list of subsets of cubes that were revealed from the bag (like 3 red, 5 green, 4 blue).

For example, the record of a few games might look like this:

Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green Game 2: 1 blue, 2 green; 3 green, 4 blue, 1 red; 1 green, 1 blue Game 3: 8 green, 6 blue, 20 red; 5 blue, 4 red, 13 green; 5 green, 1 red Game 4: 1 green, 3 red, 6 blue; 3 green, 6 red; 3 green, 15 blue, 14 red Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green In game 1, three sets of cubes are revealed from the bag (and then put back again). The first set is 3 blue cubes and 4 red cubes; the second set is 1 red cube, 2 green cubes, and 6 blue cubes; the third set is only 2 green cubes.

The Elf would first like to know which games would have been possible if the bag contained only 12 red cubes, 13 green cubes, and 14 blue cubes?

In the example above, games 1, 2, and 5 would have been possible if the bag had been loaded with that configuration. However, game 3 would have been impossible because at one point the Elf showed you 20 red cubes at once; similarly, game 4 would also have been impossible because the Elf showed you 15 blue cubes at once. If you add up the IDs of the games that would have been possible, you get 8.

Determine which games would have been possible if the bag had been loaded with only 12 red cubes, 13 green cubes, and 14 blue cubes. What is the sum of the IDs of those games?

[angrycaptain19]

@sourcery-ai plan

[sourcery-ai[bot]]

Objectives

• Create a new directory day2 in the root of the repository
• Create day2/input.txt to store the puzzle input
• Create day2/part1.py to implement the solution for part 1
• Implement a function to parse game records from input text into structured data
• Implement a function to validate if a game is possible given the cube limits (12 red, 13 green, 14 blue)
• Implement a function to calculate the sum of IDs of possible games
• Create day2/test_part1.py with unit tests using the example data from the problem
• Add a section in README.md documenting Day 2's problem and solution approach
• Follow the same project structure as established in day1 for consistency

Setup commands

File changes

README.md

• Add a new section for Day 2: Cube Conundrum.
• Document the problem statement for Day 2 Part 1.
• Provide instructions on how to run the solution for Day 2 Part 1.
• Provide instructions on how to run tests for Day 2 Part 1.

day2/input.txt

• Create a new file to store the puzzle input for Day 2 Part 1.

day2/part1.py

• Create a new file to implement the solution for Day 2 Part 1.
• Implement a function to parse game records from input text into structured data.
• Implement a function to validate if a game is possible given the cube limits (12 red, 13 green, 14 blue).
• Implement a function to calculate the sum of IDs of possible games.
• Implement a main function to read input, process the data, and print the result.

day2/test_part1.py

• Create a new file to implement unit tests for Day 2 Part 1.
• Write tests for the function that parses game records.
• Write tests for the function that validates if a game is possible.
• Write tests for the function that calculates the sum of IDs of possible games.

Verify commands

---

This plan was automatically generated. Please review the plan carefully and make any necessary adjustments.

[angrycaptain19]

@sourcery-ai develop