Kay and Laura.rb

Kay_and_Laura_adagrams.rb

@@ -0,0 +1,137 @@
+require ‘csv’
+require ‘pry’
+
+def draw_letters
+
+ # all letters
+ letters = %W(a a a a a a a a a b b c c d d d d e e e e e e e e e e e e f f g g g h h i i i i i i i i i j k l l l l m m n n n n n n o o o o o o o o p p q r r r r r r s s s s t t t t t t u u u u v v w w x y y z )
+ # convert to upcase
+ letters = letters.map do |letter|
+   letter.upcase
+ end
+ # range
+ max = letters.length - 1
+ min = 0
+
+ # index used
+ indices_used= []
+
+ # generate random index
+ index = Random.rand(min..max)
+
+ # get 10 unique indices, and saved them in indices used
+ 10.times do
+   # check if index is in indices_used array , if true generate new random index
+   while indices_used.include?(index)
+     index = Random.rand(min..max)
+   end
+   # if not is not in indices used, add it there
+   indices_used << index
+ end
+ ten_letters = indices_used.map do |index|
+   letters[index]
+ end
+
+ return ten_letters
+end
+
+def uses_available_letters?(input, letters_in_hand)
+ result = []
+ final_results = []
+ input.each_char do |letter|
+   # check if letter exists in letters_in_han
+   if letters_in_hand.include?(letter)
+     result << true
+   else
+     # user used a letter that does not exists
+     result << false
+   end
+ end
+ final_results << result.all? { |value| value == true}
+
+ input.each_char do |letter|
+   # check if letter exists in letters_in_hand
+   if letters_in_hand.include?(letter)
+     letters_in_hand.delete(letter)
+   else
+     # user used a letter that does not exists
+     final_results << false
+   end
+ end
+ # returns true if all values in results are true
+ return final_results.all? { |value| value == true}
+end
+
+def score_word(word)
+ score = 0
+ group1 = %w(A E I O U L N R S T)
+ group2 = %w(D G)
+ group3 = %w(B C M P)
+ group4 = %w(F H V W Y)
+ group5 = %w(J X)
+ group6 = %w(Q Z)
+ word.upcase.each_char do |letter|
+   if group1.include?(letter)
+     score += 1
+   elsif group2.include?(letter)
+     score += 2
+   elsif group3.include?(letter)
+     score += 3
+   elsif group4.include?(letter)
+     score += 4
+   elsif group5.include?(letter)
+     score += 8
+   elsif group6.include?(letter)
+     score += 10
+   end
+ end
+ if word.length >= 7 && word.length <= 10
+   score += 8
+ end
+ return score
+end
+
+def highest_score_from(words)
+ # create hash of words and score
+ data = {}
+ winner = “”
+ # create hash of words and scores
+ # return key value pair, key = word, and value = score, add it to hash
+ words.each do |word|
+   data[word] = score_word(word)
+ end
+ # get max value in hash
+ max = data.max_by {|k, v| v}[1]
+ # select key - value pair/s
+ # returns array of words
+ ties_words = data.select{ |k, v| v == max}.keys
+ if ties_words.length == 1 # no ties
+   winner = ties_words[0]
+ else # ties
+   ties_words.each do |word|
+     if word.length == 10 # select word length 10 and return it as a winner
+       winner = word
+       # finds winner in data, and return it’s value for the score
+       score = data.select{ |k, v| k == winner}.values[0]
+       return {:word => winner, :score => score}
+     else # select shortest word and return it as a winner
+       winner = ties_words.sort_by {|x| x.length}.first
+     end
+   end
+ end
+ score = data.select{ |k, v| k == winner}.values[0]
+ return {:word => winner, :score => score}
+end
+
+
+def is_in_english_dict?(input)  #input is a string
+ answer = “”
+ CSV.open(“assets/dictionary-english.csv”, ‘r’).each do |line|
+   if line[0] == input
+     answer = true
+   else
+     answer = false
+   end
+ end
+ return answer
+end

lib/adagrams.rb

@@ -0,0 +1,139 @@
+require 'csv'
+require 'pry'
+
+def draw_letters
+
+  # all letters
+  letters = %W(a a a a a a a a a b b c c d d d d e e e e e e e e e e e e f f g g g h h i i i i i i i i i j k l l l l m m n n n n n n o o o o o o o o p p q r r r r r r s s s s t t t t t t u u u u v v w w x y y z )
+  # convert to upcase
+  letters = letters.map do |letter|
+    letter.upcase
+  end
+  # range
+  max = letters.length - 1
+  min = 0
+
+  # index used
+  indices_used= []
+
+  # generate random index
+  index = Random.rand(min..max)
+
+  # get 10 unique indices, and saved them in indices used
+  10.times do
+    # check if index is in indices_used array , if true generate new random index
+    while indices_used.include?(index)
+      index = Random.rand(min..max)
+    end
+    # if not is not in indices used, add it there
+    indices_used << index
+  end
+  ten_letters = indices_used.map do |index|
+    letters[index]
+  end
+
+  return ten_letters
+end
+
+def uses_available_letters?(input, letters_in_hand)
+  result = []
+  final_results = []
+  input.each_char do |letter|
+    # check if letter exists in letters_in_han
+    if letters_in_hand.include?(letter)
+      result << true
+    else
+      # user used a letter that does not exists
+      result << false
+    end
+  end
+  final_results << result.all? { |value| value == true}
+
+  input.each_char do |letter|
+    # check if letter exists in letters_in_hand
+    if letters_in_hand.include?(letter)
+      letters_in_hand.delete(letter)
+    else
+      # user used a letter that does not exists
+      final_results << false
+    end
+  end
+  # returns true if all values in results are true
+  return final_results.all? { |value| value == true}
+end
+
+def score_word(word)
+  score = 0
+  group1 = %w(A E I O U L N R S T)
+  group2 = %w(D G)
+  group3 = %w(B C M P)
+  group4 = %w(F H V W Y)
+  group5 = %w(J X)
+  group6 = %w(Q Z)
+  word.upcase.each_char do |letter|
+    if group1.include?(letter)
+      score += 1
+    elsif group2.include?(letter)
+      score += 2
+    elsif group3.include?(letter)
+      score += 3
+    elsif group4.include?(letter)
+      score += 4
+    elsif group5.include?(letter)
+      score += 8
+    elsif group6.include?(letter)
+      score += 10
+    end
+  end
+  if word.length >= 7 && word.length <= 10
+    score += 8
+  end
+  return score
+end
+
+def highest_score_from(words)
+  # create hash of words and score
+  data = {}
+  winner = ""
+  # create hash of words and scores
+  # return key value pair, key = word, and value = score, add it to hash
+  words.each do |word|
+    data[word] = score_word(word)
+  end
+  # get max value in hash
+  max = data.max_by {|k, v| v}[1]
+  # select key - value pair/s
+  # returns array of words
+  ties_words = data.select{ |k, v| v == max}.keys
+  if ties_words.length == 1 # no ties
+    winner = ties_words[0]
+  else # ties
+    ties_words.each do |word|
+      if word.length == 10 # select word length 10 and return it as a winner
+        winner = word
+        # finds winner in data, and return it's value for the score
+        score = data.select{ |k, v| k == winner}.values[0]
+        return {:word => winner, :score => score}
+      else # select shortest word and return it as a winner
+        winner = ties_words.sort_by {|x| x.length}.first
+      end
+    end
+  end
+  score = data.select{ |k, v| k == winner}.values[0]
+  return {:word => winner, :score => score}
+end
+
+
+def is_in_english_dict?(input)  #input is a string
+  answer = ""
+  CSV.open("assets/dictionary-english.csv", 'r').each do |line|
+    if line[0] == input
+      answer = true
+    else
+      answer = false
+    end
+  end
+  return answer
+end
+
+is_in_english_dict?("zwitterion")

specs/adagrams_spec.rb

@@ -1,6 +1,7 @@
 require 'minitest/autorun'
 require 'minitest/reporters'
 require 'minitest/skip_dsl'
+require 'pry'
 
 require_relative '../lib/adagrams'
 
@@ -148,7 +149,7 @@
       expect(score_word(words.first)).must_equal 18
       expect(score_word(words.last)).must_equal 18
 
-      best_word = highest_score_from words
+      best_word = highest_score_from(words)
 
       expect(best_word[:word]).must_equal 'AAAAAAAAAA'
       expect(best_word[:score]).must_equal 18
@@ -162,10 +163,32 @@
       expect(score_word(words.first)).must_equal 18
       expect(score_word(words.last)).must_equal 18
 
-      best_word = highest_score_from words
+      best_word = highest_score_from(words)
 
       expect(best_word[:word]).must_equal words.first
       expect(best_word[:score]).must_equal 18
     end
   end
+
+  describe 'is_in_english_dict?' do
+    it 'looks in the dictionary in csv file to verify input is word' do
+      #Assign
+      word = ['sdfsdfsdfsd']
+
+      #Act #Assert
+      expect(is_in_english_dict?(word)).must_equal false
+    end
+
+    it 'reads the entire csv file by using the last word' do
+      #Assign
+      word = "zwitterion"
+
+      debug = is_in_english_dict?(word)
+      #binding.pry
+      #Act #Assert
+      expect(is_in_english_dict?(word)).must_equal true
+
+    end
+
+  end
 end