BOARD_FILE = "board_4x4_3.txt"
WORD_FILE = "twl06.txt"
SCORE_FILE = "scrabble-vals.txt"
MAX_MOVES = 100
SHOW_Q = 0

# Load board file
boardFile = open(BOARD_FILE)
board = []
for line in boardFile:
board.append(line.split())
boardFile.close()

# Load words file
wordFile = open(WORD_FILE)
words = []
for line in wordFile:
words.append(line.strip().upper())
wordFile.close()

# Load scoring file
scoreFile = open(SCORE_FILE)
score = {}
for line in scoreFile:
score[line.split()[0]] = int(line.split()[1])
scoreFile.close()

# Helper function to score words
def scoreWords(w):
total = 0
for word in w:
   for i in range(len(word)):
         total += score[word[i]]
return total

# Helper function to count unique words
def wlist(nodes):
w = []
for node in nodes:
   if node[0] in words:
         w.append(node[0])
w.sort()
print(str(len(w))+" unique words found: "+str(w))
return w

# Helper function to compute frontier q size
def qsize(nodes):
m = len(nodes)
lengths = [len(x[0]) for x in nodes]
x = []
for i in range(min(lengths),max(lengths)+1):
   if len(x) > 0:
         x.append(lengths.count(i) + x[-1])
   else:
         x.append(lengths.count(i))
a = sum(x)/len(x)
print("Avg(Max) Frontier Q size: "+"{0:.2f}".format(a)+"("+str(m)+")")

# Helper function to compute depth
def depth(nodes):
lengths = [len(x[0])-1 for x in nodes]
m = max(lengths)
a = sum(lengths) / len(lengths)
print("Avg(Max) searched node depth: "+"{0:.2f}".format(a)+"("+str(m)+")")

# Helper function to compute branching factor
def bfactor(board, nodes):
counts = []
for i in range(len(nodes)):
   count = 0
   node = nodes[i]
   neighbors = getNeighbors(board, node)
   for neighbor in neighbors:
         if neighbor not in nodes[0:i-1]:
            count += 1
   counts.append(count)
a = sum(counts)/len(counts)
print("Avg branching factor: "+"{0:.2f}".format(a))

# Helper function to compute scroggle score
def sscore(nodes):
w = []
for node in nodes:
   if node[0] in words:
         w.append(node

1. Give the pre-order, in-order, and post-order traversals for the...