Last active
December 10, 2016 13:14
Challenge #294 Rack Management 3
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# [2016-12-09] Challenge #294 [Hard] Rack management 3 | |
# https://www.reddit.com/r/dailyprogrammer/comments/5hcd0x/20161209_challenge_294_hard_rack_management_3/ | |
import copy, random, timeit | |
original_row = "sd?zeioao?mluvepesceinfxt?wyiru?ie?giator?t??nuefje?l?odndrotpewlgoobiinysagacaqski?aeh?rbhaervtnl?m" | |
words = [[line.strip(), 0] for line in open("enable1.txt") if len(line.strip()) < 11] | |
letters = "abcdefghijklmnopqsrtuvwxyz" | |
scores = [1,3,3,2,1,4,2,4,1,8,5,1,3,1,1,3,10,1,1,1,1,4,4,8,4,10] | |
practice = False | |
test = [6,0,0,5,5,3,6,6,5,0,6,7,1,2,1] | |
iteration = 0 | |
tilescores = dict(zip("abcdefghijklmnopqrstuvwxyz?", [1,3,3,2,1,4,2,4,1,8,5,1,3,1,1,3,10,1,1,1,1,4,4,8,4,10,0])) | |
char_freq = {'a': 22, 'c': 15, 'b': 9, 'e': 25, 'd': 16, 'g': 13, 'f': 7, 'i': 23, 'h': 10, 'k': 6, 'j': 1, 'm': 11, 'l': 17, 'o': 19, 'n': 20, 'q': 0, 'p': 12, 's': 24, 'r': 21, 'u': 14, 't': 18, 'w': 5, 'v': 4, 'y': 8, 'x': 2, 'z': 3} | |
def calcScore(word): | |
return sum(j * tilescores[char] for j, char in enumerate(word, 1)) | |
def sortWord(word): | |
word = "".join([p[0] for p in sorted([[letter, char_freq[letter]] for letter in word], key=lambda x: x[1])]) | |
return word | |
def bestWord(hand): | |
cutoff = 10 | |
bestword = ["", 0, ""] | |
perm_unknown = hand.count("?") | |
for word in words: | |
unknown = perm_unknown | |
temp_hand = hand[:] | |
score_word = word[0][:] | |
yes = True | |
for index, letter in enumerate(word[2]): | |
if letter in temp_hand: | |
temp_hand = temp_hand.replace(letter, "", 1) | |
elif unknown > 0: | |
# score_word = score_word[:index] + "?" + score_word[index + 1:] | |
score_word = score_word.replace(letter, '?', 1) | |
unknown -= 1 | |
else: | |
yes = False | |
break | |
if yes: | |
if cutoff < 0: | |
break | |
else: | |
cutoff -= 1 | |
# print(word) | |
temp_score = calcScore(score_word) | |
if temp_score > bestword[1]: | |
bestword = [word[0], temp_score, score_word] | |
# bestword.append(score_word) | |
return bestword | |
def randomHand(hand, row, order=False): | |
global iteration | |
# print("hand", hand) | |
if not practice: | |
stealLeft = random.randint(0, 10 - len(hand)) | |
else: | |
stealLeft = test[iteration] | |
if order and len(order) > iteration: | |
stealLeft = order[iteration] | |
iteration += 1 | |
if stealLeft > len(row): | |
stealLeft = len(row) | |
# print("stealLeft", stealLeft) | |
hand += row[0:stealLeft] | |
row = row[stealLeft:] | |
stealRight = 10 - len(hand) | |
# print("stealRight", stealRight) | |
if stealRight > len(row): | |
stealRight = len(row) | |
if stealRight > 0: | |
hand += row[-stealRight:] | |
row = row[:-stealRight] | |
return [stealLeft, hand, row, bestWord(hand)] | |
currentArray = [0] | |
currentBest = [0, 0] | |
currentAttempt = 0 | |
def updateSeq(score): | |
global currentAttempt, currentBest, currentArray | |
currentAttempt += 1 | |
if score > currentBest[1]: | |
currentBest = [currentArray[-1], score] | |
if currentAttempt == 100: | |
currentAttempt = 0 | |
if currentArray[-1] == 9: | |
currentArray[-1] = currentBest[0] | |
print("Moving Down, Best Seq: ", currentArray) | |
currentArray.append(0) | |
else: | |
currentArray[-1] += 1 | |
def attackRow(): | |
global iteration | |
currentAttack = [] | |
iteration = 0 | |
hand = "" | |
totalScore = 0 | |
row = original_row[:] | |
empty = False | |
while len(row) > 0 or not empty: | |
left, hand, row, bestword = randomHand(hand, row, currentArray) | |
# print("row", row) | |
# print("handpick", left, hand) | |
# print("bestword", bestword) | |
try: | |
currentAttack.append(str(left) + " " + bestword[2] + " " + bestword[0]) | |
except: | |
print("Error!") | |
print(left, bestword) | |
currentAttack.append((left, bestword)) | |
if bestword[2] == "": | |
empty = True | |
totalScore += bestword[1] | |
for letter in bestword[2]: | |
hand = hand.replace(letter, "", 1) | |
currentAttack.append("Hand: " + str(hand) + " | Row: " + str(row)) | |
updateSeq(totalScore) | |
return [totalScore, currentAttack] | |
if __name__ == "__main__": | |
for index, item in enumerate(words): | |
words[index][1] = calcScore(item[0]) | |
words[index].append(sortWord(item[0])) | |
words = sorted(words, key=lambda x: x[1], reverse=True) | |
best = [0, ""] | |
mainCounter = 0 | |
start = timeit.default_timer() | |
while 1: | |
results = attackRow() | |
if results[0] > best[0]: | |
# if 1 == 1: | |
best = results | |
for sentence in results[1]: | |
print(sentence) | |
print("Total Score: " + str(results[0])) | |
mainCounter += 1 | |
if mainCounter > 9: | |
print(timeit.default_timer() - start) | |
start = timeit.default_timer() | |
mainCounter = 0 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment