Day 7: Camel Cards

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ

  • What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
  • Where do I participate?: https://adventofcode.com/
  • Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465

🔒 Thread is locked until there's at least 100 2 star entries on the global leaderboard

🔓 Thread has been unlocked after around 20 mins

  • purplemonkeymad@programming.dev
    ·
    7 months ago

    This wasn't too bad. Had a worried moment when the part 2 solution took more than half a second. Maybe a better solution that brute forcing all the joker combinations, but it worked.

    Python
    import re
    import argparse
    import itertools
    from enum import Enum
    
    rule_jokers_enabled = False
    
    class CardType(Enum):
        HighCard = 1
        OnePair = 2
        TwoPair = 3
        ThreeOfAKind = 4
        FullHouse = 5
        FourOfAKind = 6
        FiveOfAKind = 7
    
    class Hand:
        def __init__(self,cards:str,bid:int) -> None:
            self.cards = cards
            self.bid = int(bid)
            if rule_jokers_enabled:
                self.type = self._find_type_joker(cards)
            else:
                self.type = self._find_type(cards)
    
        def _find_type(self,cards:str) -> CardType:
            # group cards based on card counts
            card_list = [*cards]
            card_list.sort()
            grouping = itertools.groupby(card_list,lambda x:x)
            lengths = [len(list(x[1])) for x in grouping]
            if 5 in lengths:
                return CardType.FiveOfAKind
            if 4 in lengths:
                return CardType.FourOfAKind
            if 3 in lengths and 2 in lengths:
                return CardType.FullHouse
            if 3 in lengths:
                return CardType.ThreeOfAKind
            if len([x for x in lengths if x == 2]) == 2:
                return CardType.TwoPair
            if 2 in lengths:
                return CardType.OnePair
            return CardType.HighCard
        
        def _find_type_joker(self,cards:str) -> CardType:
            try:
                joker_i = cards.index("J") 
            except ValueError:
                return self._find_type(cards)
            
            current_value = CardType.HighCard
            for new_card in [*(valid_card_list())]:
                if new_card == "J":
                    continue
                test_cards = list(cards)
                test_cards[joker_i] = new_card
                new_value = self._find_type_joker("".join(test_cards))
                if new_value.value > current_value.value:
                    current_value = new_value
            
            return current_value
    
        
        def sort_string(self):
            v = str(self.type.value) + ":" + "".join(["abcdefghijklmnoZ"[card_value(x)] for x in [*self.cards]])
            return v
        
        def __repr__(self) -> str:
            return f""
    
    
    
    def valid_card_list() -> str:
        if rule_jokers_enabled:
            return "J23456789TQKA"
        return "23456789TJQKA"
    
    def card_value(char:chr):
        return valid_card_list().index(char)
    
    def main(line_list: list):
        hand_list = list()
        for l in line_list:
            card,bid = re.split(' +',l)
            hand = Hand(card,bid)
            hand_list.append(hand)
            #print(hand.sort_string())
        
        hand_list.sort(key=lambda x: x.sort_string())
        print(hand_list)
    
        rank_total = 0
        rank = 1
        for single_hand in hand_list:
            rank_total += rank * single_hand.bid
            rank += 1
        
        print(f"total {rank_total}")
    
    if __name__ == "__main__":
        parser = argparse.ArgumentParser(description="day 1 solver")
        parser.add_argument("-input",type=str)
        parser.add_argument("-part",type=int)
        args = parser.parse_args()
    
        if args.part == 2:
            rule_jokers_enabled = True
    
        filename = args.input
        if filename == None:
            parser.print_help()
            exit(1)
        file = open(filename,'r')
        main([line.rstrip('\n') for line in file.readlines()])
        file.close()
    
    • Faresh@lemmy.ml
      ·
      edit-2
      7 months ago

      I think one doesn't need to generate all combinations. All combinations using cards already present in the hand should be enough (since a joker can only increase the value of the hand by being grouped with existing cards (since in this game having four of a kind is always better than having any hand with a four of a kind/full house and having 3 is always better than any hand with pairs, and having a pair is better than any card without any cards of the same kind)). This massively decreases the amount of combinations needed to be generated per jokery hand.