hi cherrymatt

    def succAndProbReward(self, state, action):
        # BEGIN_YOUR_CODE (our solution is 53 lines of code, but don't worry if you deviate from this)
        totalCardValue = state[0]
        peekIndex = state[1]
        deckCardCounts = state[2]
        possibleStates = []
        if deckCardCounts is None:
            return possibleStates #deck is empty, game is over
        if action == "Quit":
            possibleStates.append(((totalCardValue, None, None), 1.0, totalCardValue))
        totalCardCount = sum(val for val in deckCardCounts)
        if action == "Peek": #look through each available card in deck
            if peekIndex is not None:
                return possibleStates
            for idx, val in enumerate(deckCardCounts):
                if val > 0:
                    possibleStates.append(((totalCardValue, idx, deckCardCounts), val / float(totalCardCount), -1))
        if action == "Take":
            lstCounts = list(deckCardCounts)
            if peekIndex is not None: #peeked last round
                lstCounts[peekIndex] -= 1
                newCardSum = totalCardValue + self.cardValues[peekIndex]
                if newCardSum > self.threshold:
                    possibleStates.append(((newCardSum, None, None), 1.0, 0))
                elif totalCardCount == 1:
                    possibleStates.append(((newCardSum, None, None), 1.0, newCardSum))
                else:
                    possibleStates.append(((newCardSum, None, tuple(lstCounts)), 1.0, 0))

            else:
                for idx, val in enumerate(deckCardCounts):
                    if val > 0:
                        lstCounts[idx] -= 1
                        newCardSum = totalCardValue + self.cardValues[idx]
                        if newCardSum > self.threshold: #bust
                            possibleStates.append(((newCardSum, None, None), val / float(totalCardCount), 0))
                        elif totalCardCount == 1:
                            possibleStates.append(((newCardSum, None, None), val / float(totalCardCount), newCardSum))
                        else:
                            possibleStates.append(((newCardSum, None, tuple(lstCounts)), val / float(totalCardCount), 0))
                        lstCounts[idx] += 1
        return possibleStates