[Blogging Intensifies]

Technology, Coding, Music, Life...

  • About
  • Friends
  • Music
  • Photo Gallery

AdventOfCode2022

Advent of Code 2022, Day 2

December 2, 2022

Day 2 – Cheating at Rock Paper Scissors

The Problem Part 1:

The Elves begin to set up camp on the beach. To decide whose tent gets to be closest to the snack storage, a giant Rock Paper Scissors tournament is already in progress.

Rock Paper Scissors is a game between two players. Each game contains many rounds; in each round, the players each simultaneously choose one of Rock, Paper, or Scissors using a hand shape. Then, a winner for that round is selected: Rock defeats Scissors, Scissors defeats Paper, and Paper defeats Rock. If both players choose the same shape, the round instead ends in a draw.

Appreciative of your help yesterday, one Elf gives you an encrypted strategy guide (your puzzle input) that they say will be sure to help you win. “The first column is what your opponent is going to play: A for Rock, B for Paper, and C for Scissors. The second column–” Suddenly, the Elf is called away to help with someone’s tent.

The second column, you reason, must be what you should play in response: X for Rock, Y for Paper, and Z for Scissors. Winning every time would be suspicious, so the responses must have been carefully chosen.

The winner of the whole tournament is the player with the highest score. Your total score is the sum of your scores for each round. The score for a single round is the score for the shape you selected (1 for Rock, 2 for Paper, and 3 for Scissors) plus the score for the outcome of the round (0 if you lost, 3 if the round was a draw, and 6 if you won).

The Problem Part 2:

The Elf finishes helping with the tent and sneaks back over to you. “Anyway, the second column says how the round needs to end: X means you need to lose, Y means you need to end the round in a draw, and Z means you need to win. Good luck!”

So, the simplest way to deal with the input file, which were combinations of ABC and XYZ, is a dictionary, with the possible scores.  As mentioned earlier, a lot of of these are running a pile of data through a loop, and often the actual puzzle, is figuring out the simplest way to loop through and match values.  This could have been done with a ton of IF/Else cases or even a Switch style statement as well.  The data doesn’t change so both Part 1 and Part 2 could be calculated at once pretty easily.

with open("Day02Input.txt") as file:
        games = file.read()

rps = games.split("\n")

scores_dict1 = {"A X": 4,
                "A Y": 8,
                "A Z": 3,
                "B X": 1,
                "B Y": 5,
                "B Z": 9,
                "C X": 7,
                "C Y": 2,
                "C Z": 6, }

scores_dict2 = {"A X": 3,
                "A Y": 4,
                "A Z": 8,
                "B X": 1,
                "B Y": 5,
                "B Z": 9,
                "C X": 2,
                "C Y": 6,
                "C Z": 7, }

total1 = 0
total2 = 0

for each in rps:
    total1 += scores_dict1[each]
    total2 += scores_dict2[each]

print(total1)
print(total2)
Posted in: Advent of Code Tagged: AdventOfCode2022, Coding, Pytthon

Advent of Code 2022, Day 1

December 1, 2022

Another year, another Advent of Code. Though I kind of skipped last year. I think I may have been too busy or something. I do enjoy doing these puzzles, though they aren’t really “code projects”.  Each day is just a puzzle, that is solved with math.  Most of the problem, is figuring out what exactly is being asked.  The other part is just, figuring out how to format the data set you are given.  A lot of these are kind of repetitive, open your data file, read it in, convert it to a useful format, loop through the data, performing some action, and output some sort of total.

For this year’s theme, Santa’s Elves are taking a journey to a magical grove to collect food for the reindeer.

Day 1 – Elf Food Calories

The Problem Part 1:

The jungle must be too overgrown and difficult to navigate in vehicles or access from the air; the Elves’ expedition traditionally goes on foot. As your boats approach land, the Elves begin taking inventory of their supplies. One important consideration is food – in particular, the number of Calories each Elf is carrying (your puzzle input).

The Elves take turns writing down the number of Calories contained by the various meals, snacks, rations, etc. that they’ve brought with them, one item per line. Each Elf separates their own inventory from the previous Elf’s inventory (if any) by a blank line.

In case the Elves get hungry and need extra snacks, they need to know which Elf to ask: they’d like to know how many Calories are being carried by the Elf carrying the most Calories.

The Problem Part 2

By the time you calculate the answer to the Elves’ question, they’ve already realized that the Elf carrying the most Calories of food might eventually run out of snacks.

To avoid this unacceptable situation, the Elves would instead like to know the total Calories carried by the top three Elves carrying the most Calories. That way, even if one of those Elves runs out of snacks, they still have two backups.

So, each day consists of a Part 1 and a Part 2.  Generally speaking, each of these two parts is semi related, and can be completed with most of the same code. This one is simple enough, split the list up by lines, then split it into each elf’s calories, sort the list so the highest valies are at the front and print those three values out.  Part 1 only needs the highest, Part 2 needs the next two.

with open("Day01Input.txt") as file:
    calories = file.read()

calories = calories.replace("\n"," ")
elves = [each.split(" ") for each in calories.split("  ")]
totals = []

for each in elves:
    total = 0
    for i in each:
        total += int(i)
    totals.append(total)
 
totals.sort(reverse=True)
print(totals[0]+totals[1]+totals[2])    
Posted in: Advent of Code Tagged: AdventOfCode2022, Coding, Python
« Previous 1 … 4 5
Code Projects
Photo Gallery
Music
About

Categories

Social Media

MastodonLinkedIn

emailInstagramInstagram

GitHubLetterboxdDuolongo
GoodreadsLast.fmElite Dangerous INARA
Lameazoid Logo

Support this site.

Join EFF!

Copyright © 2023 [Blogging Intensifies].

Me WordPress Theme by themehall.com