Lindsay + Katricia - Edges - Adagrams

adagrams.rb

@@ -0,0 +1,136 @@
+require 'pry'
+
+#create data structure
+all_letters = []
+
+letters = {"A" => 9, "B" => 2, "C" => 2, "D"=> 4, "E" => 12, "F"=> 2, "G"=>3, "H"=>2, "I" => 9, "J"=>1, "K"=> 1, "L"=>4, "M"=> 2, "N"=> 6, "O"=>8, "P" => 2, "Q" => 1, "R"=>6, "S"=>4, "T"=>6, "U"=>4, "V"=>2, "W"=>2, "X"=>1, "Y"=>2, "Z"=>1}
+
+
+# Fill pool of letters array with letters
+letters.each do |letter, freq|
+  count = 0
+  until count == freq
+    all_letters << letter
+    count += 1
+  end
+end
+
+
+# Define method for creating user hand
+def draw_letters(array)
+  user_letters = array.sample(10)
+  return user_letters
+end
+
+DRAWN_LETTERS = draw_letters(all_letters)
+
+
+# Transform input word string into array, all in capital letters
+def make_word_array(input)
+  input = input.upcase.split("")
+  return input
+end
+
+
+#create method to see if word uses letters that are actually available
+def uses_available_letters? (input, drawn_letters)
+  is_valid = "default"
+  word_letters = make_word_array(input)
+  word_letters.each do |letter|
+    if drawn_letters.include?letter
+      is_valid = true
+      puts "letter valid " + "#{is_valid}"
+      letter_index = drawn_letters.index(letter)
+      drawn_letters.delete_at(letter_index)
+    else
+      is_valid = false
+      puts "letter not valid " + "#{is_valid}"
+      return is_valid
+    end
+  end
+  return is_valid
+end
+
+
+puts "drawn letters: #{DRAWN_LETTERS}"
+
+
+#turn all_letters array into a hash that represents the score of each letter
+LETTER_SCORES = {}
+
+# Make hash for letter to score
+all_letters.uniq.each do |letter|
+
+  case letter
+  when "A","E", "I", "O", "U", "L", "N", "R", "S", "T"
+    score = 1
+  when "D", "G"
+    score = 2
+  when "B", "C", "M", "P"
+    score = 3
+  when "F", "H", "V", "W", "Y"
+    score = 4
+  when "K"
+    score = 5
+  when "J", "X"
+    score = 8
+  when "Q", "Z"
+    score = 10
+  else
+    score = 0
+  end
+
+  LETTER_SCORES[letter] = score
+end
+
+puts "Letter point values: #{LETTER_SCORES}"
+
+#create method for scoring word
+def score_word(word)
+  word_letters = make_word_array(word)
+  score = 0
+  word_letters.each do |letter|
+    score += LETTER_SCORES[letter]
+  end
+  score += 8 if word.length >= 7 && word.length <= 10
+  return score
+end
+
+
+#create a method to return a hash with the highest scoring words
+def highest_score_from(words)
+  all_words_scores = []
+
+  # Calculate scores of all words
+  words.each do |word|
+    each_word_score = {}
+    each_word_score[:word] = word
+    each_word_score[:score] = score_word(word)
+    all_words_scores << each_word_score
+  end
+
+  word_rank = all_words_scores.each.sort_by {|hash| hash[:score]}.reverse
+
+  puts "word rank: #{word_rank}"
+
+  best_word = word_rank[0]
+
+  word_rank.each_with_index do |hash, index|
+
+    if word_rank[index][:score] > best_word[:score]
+      best_word = word_rank[index]
+
+    # Tie Handling
+    elsif word_rank[index][:score] == best_word[:score]
+      if best_word[:word].length != 10
+        if word_rank[index][:word].length == 10
+          best_word = word_rank[index]
+        elsif word_rank[index][:word].length < best_word[:word].length
+          best_word = word_rank[index]
+        end
+      end
+    end
+    index += 1
+  end
+  return best_word
+end

lib/.gitignore

@@ -0,0 +1 @@
+adagramstest.rb

lib/adagrams.rb

@@ -0,0 +1,136 @@
+require 'pry'
+
+#create data structure
+all_letters = []
+
+letters = {"A" => 9, "B" => 2, "C" => 2, "D"=> 4, "E" => 12, "F"=> 2, "G"=>3, "H"=>2, "I" => 9, "J"=>1, "K"=> 1, "L"=>4, "M"=> 2, "N"=> 6, "O"=>8, "P" => 2, "Q" => 1, "R"=>6, "S"=>4, "T"=>6, "U"=>4, "V"=>2, "W"=>2, "X"=>1, "Y"=>2, "Z"=>1}
+
+
+# Fill pool of letters array with letters
+letters.each do |letter, freq|
+  count = 0
+  until count == freq
+    all_letters << letter
+    count += 1
+  end
+end
+
+
+# Define method for creating user hand
+def draw_letters(array)
+  user_letters = array.sample(10)
+  return user_letters
+end
+
+DRAWN_LETTERS = draw_letters(all_letters)
+
+
+# Transform input word string into array, all in capital letters
+def make_word_array(input)
+  input = input.upcase.split("")
+  return input
+end
+
+
+#create method to see if word uses letters that are actually available
+def uses_available_letters? (input, drawn_letters)
+  is_valid = "default"
+  word_letters = make_word_array(input)
+  word_letters.each do |letter|
+    if drawn_letters.include?letter
+      is_valid = true
+      puts "letter valid " + "#{is_valid}"
+      letter_index = drawn_letters.index(letter)
+      drawn_letters.delete_at(letter_index)
+    else
+      is_valid = false
+      puts "letter not valid " + "#{is_valid}"
+      return is_valid
+    end
+  end
+  return is_valid
+end
+
+
+puts "drawn letters: #{DRAWN_LETTERS}"
+
+
+#turn all_letters array into a hash that represents the score of each letter
+LETTER_SCORES = {}
+
+# Make hash for letter to score
+all_letters.uniq.each do |letter|
+
+  case letter
+  when "A","E", "I", "O", "U", "L", "N", "R", "S", "T"
+    score = 1
+  when "D", "G"
+    score = 2
+  when "B", "C", "M", "P"
+    score = 3
+  when "F", "H", "V", "W", "Y"
+    score = 4
+  when "K"
+    score = 5
+  when "J", "X"
+    score = 8
+  when "Q", "Z"
+    score = 10
+  else
+    score = 0
+  end
+
+  LETTER_SCORES[letter] = score
+end
+
+puts "Letter point values: #{LETTER_SCORES}"
+
+#create method for scoring word
+def score_word(word)
+  word_letters = make_word_array(word)
+  score = 0
+  word_letters.each do |letter|
+    score += LETTER_SCORES[letter]
+  end
+  score += 8 if word.length >= 7 && word.length <= 10
+  return score
+end
+
+
+#create a method to return a hash with the highest scoring words
+def highest_score_from(words)
+  all_words_scores = []
+
+  # Calculate scores of all words
+  words.each do |word|
+    each_word_score = {}
+    each_word_score[:word] = word
+    each_word_score[:score] = score_word(word)
+    all_words_scores << each_word_score
+  end
+
+  word_rank = all_words_scores.each.sort_by {|hash| hash[:score]}.reverse
+
+  puts "word rank: #{word_rank}"
+
+  best_word = word_rank[0]
+
+  word_rank.each_with_index do |hash, index|
+
+    if word_rank[index][:score] > best_word[:score]
+      best_word = word_rank[index]
+
+    # Tie Handling
+    elsif word_rank[index][:score] == best_word[:score]
+      if best_word[:word].length != 10
+        if word_rank[index][:word].length == 10
+          best_word = word_rank[index]
+        elsif word_rank[index][:word].length < best_word[:word].length
+          best_word = word_rank[index]
+        end
+      end
+    end
+    index += 1
+  end
+  return best_word
+end