Advent of Code 2021 day 21 part 1

AoC_2021_21_1.py

import re


def turns():
    roll = 0
    while True:
        roll += 3
        delta = (roll - 2) % 100 + (roll - 1) % 100 + roll % 100
        yield delta, roll


inp = open("input_21.txt").read().strip()
pos = list(map(lambda x: int(x) - 1, re.findall(r": (\d+)", inp)))
score = [0, 0]
pid = 1  # player id

for delta, roll in turns():
    pid = 1 - pid
    pos[pid] = (pos[pid] + delta) % 10
    score[pid] += pos[pid] + 1  # my pos is zero based
    if score[pid] >= 1000:
        print(score[1 - pid] * roll)
        break