klaymen

# Problem Set 5: 6.00 Word Game
# Name: 
# Collaborators: 
# Time: 
#

import random
import string

VOWELS = 'aeiou'
CONSONANTS = 'bcdfghjklmnpqrstvwxyz'
HAND_SIZE = 7

SCRABBLE_LETTER_VALUES = {
    'a': 1, 'b': 3, 'c': 3, 'd': 2, 'e': 1, 'f': 4, 'g': 2, 'h': 4, 'i': 1, 'j': 8, 'k': 5, 'l': 1, 'm': 3, 'n': 1, 'o': 1, 'p': 3, 'q': 10, 'r': 1, 's': 1, 't': 1, 'u': 1, 'v': 4, 'w': 4, 'x': 8, 'y': 4, 'z': 10
}

# -----------------------------------
# Helper code
# (you don't need to understand this helper code)

WORDLIST_FILENAME = "words.txt"

def load_words():
    """
    Returns a list of valid words. Words are strings of lowercase letters.
    
    Depending on the size of the word list, this function may
    take a while to finish.
    """
    print "Loading word list from file..."
    # inFile: file
    inFile = open(WORDLIST_FILENAME, 'r', 0)
    # wordlist: list of strings
    wordlist = []
    for line in inFile:
        wordlist.append(line.strip().lower())
    print "  ", len(wordlist), "words loaded."
    return wordlist

def get_frequency_dict(sequence):
    """
    Returns a dictionary where the keys are elements of the sequence
    and the values are integer counts, for the number of times that
    an element is repeated in the sequence.

    sequence: string or list
    return: dictionary
    """
    # freqs: dictionary (element_type -> int)
    freq = {}
    for x in sequence:
        freq[x] = freq.get(x,0) + 1
    return freq


# (end of helper code)
# -----------------------------------

#
# Problem #1: Scoring a word
#
def get_word_score(word, n):
    """
    Returns the score for a word. Assumes the word is a
    valid word.

    The score for a word is the sum of the points for letters
    in the word, plus 50 points if all n letters are used on
    the first go.

    Letters are scored as in Scrabble; A is worth 1, B is
    worth 3, C is worth 3, D is worth 2, E is worth 1, and so on.

    word: string (lowercase letters)
    returns: int >= 0
    """
    # TO DO ...
    score = 0
    for x in word:
        score += SCRABBLE_LETTER_VALUES[x]
    if len(word) == n:
        score +=50
    return score

#
# Make sure you understand how this function works and what it does!
#
def display_hand(hand):
    """
    Displays the letters currently in the hand.

    For example:
       display_hand({'a':1, 'x':2, 'l':3, 'e':1})
    Should print out something like:
       a x x l l l e
    The order of the letters is unimportant.

    hand: dictionary (string -> int)
    """
    for letter in hand.keys():
        for j in range(hand[letter]):
            print letter,              # print all on the same line
    return ''                          # for some reason this kept returning None
    print                              # print an empty line

#
# Make sure you understand how this function works and what it does!
#
def deal_hand(n):
    """
    Returns a random hand containing n lowercase letters.
    At least n/3 the letters in the hand should be VOWELS.

    Hands are represented as dictionaries. The keys are
    letters and the values are the number of times the
    particular letter is repeated in that hand.

    n: int >= 0
    returns: dictionary (string -> int)
    """
    hand={}
    num_vowels = n / 3
    
    for i in range(num_vowels):
        x = VOWELS[random.randrange(0,len(VOWELS))]
        hand[x] = hand.get(x, 0) + 1
        
    for i in range(num_vowels, n):    
        x = CONSONANTS[random.randrange(0,len(CONSONANTS))]
        hand[x] = hand.get(x, 0) + 1
        
    return hand

#
# Problem #2: Update a hand by removing letters
#
def update_hand(hand, word):
    """
    Assumes that 'hand' has all the letters in word.
    In other words, this assumes that however many times
    a letter appears in 'word', 'hand' has at least as
    many of that letter in it. 

    Updates the hand: uses up the letters in the given word
    and returns the new hand, without those letters in it.

    Has no side effects: does not mutate hand.

    word: string
    hand: dictionary (string -> int)    
    returns: dictionary (string -> int)
    """
    # TO DO ...
    letterstoremove = []
    for x in word:
        hand[x] = hand.get(x, 0) - 1
    for y in hand:
        if hand[y] == 0:
            letterstoremove += [y]
    for z in letterstoremove:
        del hand[z]
    return hand
    

#
# Problem #3: Test word validity
#
def is_valid_word(word, hand, word_list):
    """
    Returns True if word is in the word_list and is entirely
    composed of letters in the hand. Otherwise, returns False.
    Does not mutate hand or word_list.
    
    word: string
    hand: dictionary (string -> int)
    word_list: list of lowercase strings
    """
    # TO DO ...
    handcopy = hand.copy()

    for x in word:
        if x not in handcopy: return False
        if handcopy[x] > 0:
            handcopy[x] = handcopy.get(x, 0) - 1
        else: return False
    for y in word_list:
        if word == y: return True
    return False

#
# Problem #4: Playing a hand
#
def play_hand(hand, word_list):
    """
    Allows the user to play the given hand, as follows:

    * The hand is displayed.
    
    * The user may input a word.

    * An invalid word is rejected, and a message is displayed asking
      the user to choose another word.

    * When a valid word is entered, it uses up letters from the hand.

    * After every valid word: the score for that word and the total
      score so far are displayed, the remaining letters in the hand 
      are displayed, and the user is asked to input another word.

    * The sum of the word scores is displayed when the hand finishes.

    * The hand finishes when there are no more unused letters.
      The user can also finish playing the hand by inputing a single
      period (the string '.') instead of a word.

    * The final score is displayed.

      hand: dictionary (string -> int)
      word_list: list of lowercase strings
    """
    

    stopper = 0
    totscore = 0

    while stopper == 0:
        handlength = []
        for letter in hand.keys():
            for j in range(hand[letter]):
                handlength += [letter]
                
        print 'Your hand: ', display_hand(hand) #apparently to have 'your hand:' and the letters in the hand on the same line, 'display_hand(hand)' must return some value. (it was returning 'None')
        #print hand     #used this command to make sure 'None' was not added to hand.
        word = raw_input('Please enter a word (enter \'.\' to end the hand): ')
        
        if is_valid_word(word, hand, word_list) and word != '.':
            wordscore = get_word_score(word, len(handlength))
            totscore += wordscore
            print 'Word Score: ', wordscore
            print 'Total Score: ', totscore
            update_hand(hand, word)
            #print hand
        elif word != '.': print 'Sorry, that word is not valid. Please try again.'
        if word == '.':
            stopper = 1
        if len(handlength) == 0:
            stopper = 1
    print 'Total Score: ', totscore
    print 'thanks for playing :)'
    
    
        


    
#
# Problem #5: Playing a game
# Make sure you understand how this code works!
# 
def play_game(word_list):
    """
    Allow the user to play an arbitrary number of hands.

    * Asks the user to input 'n' or 'r' or 'e'.

    * If the user inputs 'n', let the user play a new (random) hand.
      When done playing the hand, ask the 'n' or 'e' question again.

    * If the user inputs 'r', let the user play the last hand again.

    * If the user inputs 'e', exit the game.

    * If the user inputs anything else, ask them again.
    """
    # TO DO ...
##    print "play_game not implemented."         # delete this once you've completed Problem #4
##    play_hand(deal_hand(HAND_SIZE), word_list) # delete this once you've completed Problem #4

    
    ## uncomment the following block of code once you've completed Problem #4
    hand = deal_hand(HAND_SIZE) # random init
    while True:
        cmd = raw_input('Enter n to deal a new hand, r to replay the last hand, or e to end game: ')
        if cmd == 'n':
            hand = deal_hand(HAND_SIZE)
            play_hand(hand.copy(), word_list)
            print
        elif cmd == 'r':
            play_hand(hand.copy(), word_list)
            print
        elif cmd == 'e':
            break
        else:
            print "Invalid command."

#
# Build data structures used for entire session and play game
#
if __name__ == '__main__':
    word_list = load_words()
    play_game(word_list)

# Problem Set 4
# Name: 
# Collaborators: 
# Time: 

#
# Problem 1
#

def nestEggFixed(salary, save, growthRate, years):
    """
    - salary: the amount of money you make each year.
    - save: the percent of your salary to save in the investment account each
      year (an integer between 0 and 100).
    - growthRate: the annual percent increase in your investment account (an
      integer between 0 and 100).
    - years: the number of years to work.
    - return: a list whose values are the size of your retirement account at
      the end of each year.
    """
    # TODO: Your code here.
    assert type(save) == int, "savings must be an integer"
    assert type(salary) == int, "salary must be an integer"
    assert type(growthRate) == int, "growthRate must be an integer"
    assert type(years) == int, "years must be an integer"
    retireSize = [0]
    ctr = years
    while ctr > 0:
        retireSize += [retireSize[-1] + (salary*(save/100.0)) + (retireSize[-1]*(growthRate/100.0))]
        ctr = ctr - 1
    retireSize = tuple(retireSize[1:])
    return retireSize
    

def testNestEggFixed():
    salary     = 10000
    save       = 10
    growthRate = 15
    years      = 5
    #tested all variables as strings
    savingsRecord = nestEggFixed(salary, save, growthRate, years)
    print savingsRecord
    # Output should have values close to:
    # [1000.0, 2150.0, 3472.5, 4993.375, 6742.3812499999995]

    # TODO: Add more test cases here.
    

#
# Problem 2
#

def nestEggVariable(salary, save, growthRates):
    # TODO: Your code here.
    """
    - salary: the amount of money you make each year.
    - save: the percent of your salary to save in the investment account each
      year (an integer between 0 and 100).
    - growthRate: a list of the annual percent increases in your investment
      account (integers between 0 and 100).
    - return: a list of your retirement account value at the end of each year.
    """
    retireSize = [0]
    assert type(save) == int, "savings must be an integer"
    assert type(salary) == int, "salary must be an integer"
    for n in growthRates:
        assert type(n) == int, "all growthRates must be integers"
        retireSize += [retireSize[-1] + (salary*(save/100.0)) + (retireSize[-1]*(n/100.0))]
    retireSize = retireSize[1:]
    return retireSize
        

def testNestEggVariable():
    salary      = 10000
    save        = 10
    growthRates = [3, 4, 5, 0, 3]
    #all variables tested as strings
    savingsRecord = nestEggVariable(salary, save, growthRates)
    print savingsRecord
    # Output should have values close to:
    # [1000.0, 2040.0, 3142.0, 4142.0, 5266.2600000000002]

    # TODO: Add more test cases here.

#
# Problem 3
#

def postRetirement(savings, growthRates, expenses):
    """
    - savings: the initial amount of money in your savings account.
    - growthRate: a list of the annual percent increases in your investment
      account (an integer between 0 and 100).
    - expenses: the amount of money you plan to spend each year during
      retirement.
    - return: a list of your retirement account value at the end of each year.
    """
    # TODO: Your code here.
    assert type(savings) == int, "savings must be an integer"
    assert type(expenses) == int, "expenses must be an integer"
    moneypot = [savings]
    for n in growthRates:
        assert type(n) == int, "all growthRates must be integers"
        moneypot += [(moneypot[-1])+((n/100.0)*moneypot[-1])- expenses]
    moneypot = moneypot[1:]
    return moneypot

def testPostRetirement():
    savings     = 100000
    growthRates = [10, 5, 0, 5, 1]
    expenses    = 30000
    #all variables tested as strings
    savingsRecord = postRetirement(savings, growthRates, expenses)
    print savingsRecord
    # Output should have values close to:
    # [80000.000000000015, 54000.000000000015, 24000.000000000015,
    # -4799.9999999999854, -34847.999999999985]

    # TODO: Add more test cases here.

#
# Problem 4
#

def findMaxExpenses(salary, save, preRetireGrowthRates, postRetireGrowthRates,
                    epsilon):
    """
    - salary: the amount of money you make each year.
    - save: the percent of your salary to save in the investment account each
      year (an integer between 0 and 100).
    - preRetireGrowthRates: a list of annual growth percentages on investments
      while you are still working.
    - postRetireGrowthRates: a list of annual growth percentages on investments
      while you are retired.
    - epsilon: an upper bound on the absolute value of the amount remaining in
      the investment fund at the end of retirement.
    """
    # TODO: Your code here.

    assert type(salary) == int and salary > 0, "salary must be a positive integer"
    assert type(save) == int and save > 0, "save must be a positive integer"
    assert epsilon > 0, "epsilon must be a positive integer"
    preR = [0]
    postR = [preR[-1]]
    combined = []
    ctr = 0
    low = 0
    high = salary
    estimate = (low+high)/2.0


    for n in preRetireGrowthRates:
        assert type(n) == int, "all growthRates must be integers"
        preR += [(preR[-1] + (salary*(save/100.0)) + (preR[-1]*(n/100.0)))]
        postR = [preR[-1]]
    
    while abs(postR[-1]) > epsilon:
        assert type(n) == int, "all growthRates must be integers"
        postR = [preR[-1]]
        estimate = (low+high)/2.0
        for n in postRetireGrowthRates:
            postR += [((postR[-1])+((n/100.0)*postR[-1])) - estimate]
        if postR[-1] > epsilon:
            low = estimate
        else:
            high = estimate
        ctr += 1
##        print 'est: ', estimate
##        print 'low: ', low
##        print 'high: ', high
##        print 'preR: ', preR
##        print 'postR: ', postR
##        print 'janks: ', postR[-1]
##        print '-------------------------------------------------------------------------'
##        assert ctr <= 50, 'counter exceeded'
    return estimate
            
    
    

def testFindMaxExpenses():
    salary                = 10000
    save                  = 10
    preRetireGrowthRates  = [3, 4, 5, 0, 3]
    postRetireGrowthRates = [10, 5, 0, 5, 1]
    epsilon               = .01
    expenses = findMaxExpenses(salary, save, preRetireGrowthRates,
                               postRetireGrowthRates, epsilon)
    print expenses
    # Output should have a value close to:
    # 1229.95548986

    # TODO: Add more test cases here.

from string import *

def countSubStringMatch(target, key):
    """counts the number of times 'key' appears in 'target'"""
    counter = 0
    next = 0
    while find(target, key, next) != -1:
        next = find(target, key, next) + 1
        counter += 1
    return counter
        
        
def countSubStringMatchRecursive(target, key):
    """counts the number of times 'key' appears in 'target'"""
    counter = 0
    if find(target, key) != -1:
        counter = 1 + countSubStringMatchRecursive(target[find(target, key)+1:], key)
    return counter