day22.py

from util import Day
from aocd import submit
from collections import deque
from itertools import islice


def preprocess(data):
    out = []
    for q in data.split("\n\n"):
        q = q.split("\n")[1:]
        out.append(deque(map(int, q)))
    return tuple(out)


def cömbät(player1, player2):
    while player1 and player2:
        c1 = player1.popleft()
        c2 = player2.popleft()
        if c1 > c2:
            player1.append(c1)
            player1.append(c2)
        else:
            player2.append(c2)
            player2.append(c1)
    return player1, player2


def recürsive_cömbät(player1, player2):
    # print("\nGame time!")
    deck_tracker_p1 = set()
    deck_tracker_p2 = set()
    while player1 and player2:
        # print("Round", i := i + 1)
        q1 = False
        q2 = False

        # print("Player 1: ", player1)
        # print("Player 2: ", player2)

        if tuple(player1) in deck_tracker_p1 and tuple(player2) in deck_tracker_p2:
            # Player 1 wins by recursion default
            return player1, None
        deck_tracker_p1.add(tuple(player1))
        deck_tracker_p2.add(tuple(player2))

        card1 = player1.popleft()
        card2 = player2.popleft()

        if card1 <= len(player1) and card2 <= len(player2):
            # Recürsive Cömbät!
            # print("Recürsiön")
            
            s1, s2 = deque(islice(player1, 0, card1)), deque(islice(player2, 0, card2))
            if max(s1) > max(s2):
                # If player one has the higher card they definitely win despite recursion win
                q1 = True
            else:
                # Still a chance player 1 wins due to recursion win
                q1, q2 = recürsive_cömbät(s1, s2)
                if q2 is None:
                    q1 = True
        else:
            q1 = card1 > card2
            q2 = card1 < card2

        if q1:
            player1.append(card1)
            player1.append(card2)
        elif q2:
            player2.append(card2)
            player2.append(card1)
    return player1, player2


def score(deck):
    return sum(((i + 1) * v for i, v in enumerate(reversed(deck))))


def main(day, part=1):
    day.data = preprocess(day.data)
    if part == 1:
        game = cömbät(*day.data)
    if part == 2:
        game = recürsive_cömbät(*day.data)
    out = score(game[game[0] == deque()])
    return out


if __name__ == "__main__":
    day = Day(22)
    day.download()

    day.load(process=False)
    p1 = main(day)
    print(p1)
    submit(p1, part="a", day=22, year=2020)

    day.load(process=False)
    p2 = main(day, part=2)
    print(p2)
    submit(p2, part="b", day=22, year=2020)