Advent of Code 2022 - Day 02
Language
J (programming language), which is read right-to-left.
Part 1
Prompt
The Elves begin to set up camp on the beach. To decide whose tent gets to be closest to the snack storage, a giant [[https://en.wikipedia.org/wiki/Rock_paper_scissors][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).
Since you can't be sure if the Elf is trying to help you or trick you, you should calculate the score you would get if you were to follow the strategy guide.
For example, suppose you were given the following strategy guide:
A Y
B X
C Z
This strategy guide predicts and recommends the following:
In the first round, your opponent will choose Rock (=A=), and you should choose Paper (=Y=). This ends in a win for you with a score of *8* (2 because you chose Paper + 6 because you won).
In the second round, your opponent will choose Paper (=B=), and you should choose Rock (X). This ends in a loss for you with a score of *1* (1 + 0).
The third round is a draw with both players choosing Scissors, giving you a score of 3 + 3 = *6*.
In this example, if you were to follow the strategy guide, you would get a total score of =15= (8 + 1 + 6).
*What would your total score be if everything goes exactly according to your strategy guide?*
Code
Note that this is literally my second test in this language (after the ones in Day 01), so don't consider it as remotely idiomatic code.
Note especially the mess with Box <
usages everywhere. Those probably shouldn't be there.
Read the file and split by \n
(LF
)
lines =: > LF cut fread 'input'
$ lines
2500 3
Split the line in it's two moves (show first and last).
Transpose |:
Take first and last parts (to skip space) 0 _1 {
Transpose that again |:
moves =: |: 0 _1 { |: lines
0 _1 { moves
$ moves
BX AY 2500 2
Build a function, score
, to compute the value of a move (test with samples, should return 8, 1, 6)
Define a value
function
NB. Define score associated with each figure
fig =: 6 2 $ 'A' ; 1 ; 'B' ; 2 ; 'C' ; 3 ; 'X' ; 1 ; 'Y' ; 2 ; 'Z' ; 3
NB. First idea for `value`, it's probably horrible.
value =: verb define
NB. tmoutput 'V: '
NB. echo y
index =. ((> 0 { |: fig) i. y)
NB. tmoutput 'Index: '
NB. echo index
NB. tmoutput 'Selected: '
NB. echo index { fig
NB. tmoutput 'Dim: '
NB. echo $ index { fig
> 1 { index { fig
)
value each 'ABCXYZ'
┌─┬─┬─┬─┬─┬─┐ │1│2│3│1│2│3│ └─┴─┴─┴─┴─┴─┘
Define the outcome_table
(opponent_hand, our hand, outcome)
draws =. (1, 1, 1);(2, 2, 1);(3, 3, 1)
wins =. (1, 2, 2);(2, 3, 2);(3, 1, 2)
loses =. (1, 3, 0);(2, 1, 0);(3, 2, 0)
outcome_table =: |: > draws,wins,loses
outcome_table
1 2 3 1 2 3 1 2 3 1 2 3 2 3 1 3 1 2 1 1 1 2 2 2 0 0 0
Define the outcome
function. Select in the outcome_table
an entry that matches both opponent and our move
outcome =: verb define
v =. > value each y
opponent =. (=&(0 { v)) 0 { outcome_table
our =. (=&(1 { v)) 1 { outcome_table
outcome_num =. 1 { $ outcome_table
move_idx =. (opponent * our) # i. outcome_num
move_idx { 2 { outcome_table
)
outcome 'AY' NB. 2 - Win
outcome 'BX' NB. 0 - Lose
outcome 'CZ' NB. 1 - Draw
2 0 1
Define the score
function
score =: verb define
NB. tmoutput 'Scoring: '
NB. echo y
( value > 1 { > y ) + (outcome y) * 3
)
score 'AY'
score 'BX'
score 'CZ'
8 1 6
Score one move
score 0 { moves
1
Score all moves and sum
Box {
(with no number at left)
Score all score each
Unbox >
Sum all +/
+/ > score each { moves
15337
Part 2
Prompt
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!"
The total score is still calculated in the same way, but now you need to figure out what shape to choose so the round ends as indicated. The example above now goes like this:
In the first round, your opponent will choose Rock (=A=), and you need the round to end in a draw (=Y=), so you also choose Rock. This gives you a score of 1 + 3 = *4*.
In the second round, your opponent will choose Paper (=B=), and you choose Rock so you lose (=X=) with a score of 1 + 0 = *1*.
In the third round, you will defeat your opponent's Scissors with Rock for a score of 1 + 6 = *7*.
Now that you're correctly decrypting the ultra top secret strategy guide, you would get a total score of =12=.
Following the Elf's instructions for the second column, *what would your total score be if everything goes exactly according to your strategy guide?*
Code
Redefine the outcome
function
fixed_outcome =: verb define
(value 1 { y) - 1
)
fixed_outcome 'AY' NB. 1 - Draw
fixed_outcome 'BX' NB. 0 - Lose
fixed_outcome 'CZ' NB. 2 - Win
1 0 2
Add function to get_figure
get_figure =: verb define
opponent =. (=&(value 0 { y)) 0 { outcome_table
points =. (=&(fixed_outcome y)) 2 { outcome_table
outcome_num =. 1 { $ outcome_table
move_idx =. (opponent * points) # i. outcome_num
move_idx { 1 { outcome_table
)
get_figure 'AY' NB. 1 - Rock
get_figure 'BX' NB. 1 - Rock
get_figure 'CZ' NB. 1 - Rock
get_figure 'AZ' NB. 2 - Paper
get_figure 'AX' NB. 3 - Scissors
1 1 1 2 3
Use this new fixed_outcome
function and get_figure
on our fixed_score
fixed_score =: verb define
NB. tmoutput 'Scoring: '
NB. echo y
( get_figure y ) + (fixed_outcome y) * 3
)
fixed_score 'AY' NB. 4
fixed_score 'BX' NB. 1
fixed_score 'CZ' NB. 7
4 1 7
Sum everything
+/ > fixed_score each { moves
11696