hangman 0.0.1 → 0.1.1

data/lib/hangman.rb

@@ -1,63 +1,2 @@
-module Hangman
-  class Clue
-    # A list of letters in the order you should try them
-    # Note that the order may change based on the next letter so the 
-    # only signinficant item, in ths list is the first one
-    attr_reader :guesses
-    # A list of words that could be the solution
-    attr_reader :possible_words
-    
-    # Create a new clue
-    # the clue format is a string with underscores for unknown letters
-    # Example: "he__o"
-    # The wrong letters is a list of letters that were guessed but aren't correct
-    def initialize(clue, wrong_letters)
-      @clue = clue.to_s.downcase
-      @wrong_letters = wrong_letters
-      @letter_counts = {}
-      @possible_words = []
-      @used_letters = @clue.split(//).reject { |c| c == "_" }
-    end
-    
-    # Pass a list of words to this method to come up wth the best next guess
-    # It will return true if there are any potential guesses
-    # You can call this method multiple times on a single Clue (if you have multiple wordlists this may be helpful)
-    def solve(words)
-      length = @clue.length
-      
-      words.each do |w|
-        w = w.chomp.downcase
-        next if w.size != length
-        next if @wrong_letters.any? { |c| w.include? c }
-
-        if match_word w
-          @possible_words << w
-        end
-      end
-      @guesses = @letter_counts.sort{ |a,b| b[1] <=> a[1] }.map{ |e| e[0] }
-      
-      return !@guesses.empty?
-    end
-    
-    private
-    
-    def match_word(w)
-      wcount = {}
-      @clue.each_char.with_index do |c, i|
-        if c == '_'
-          if @used_letters.include? w[i]
-            return false
-          end
-          wcount[w[i]] = 1 # equals instead of += because we want unique per word
-        elsif w[i] != c
-          return false
-        end
-      end
-      
-      @letter_counts.merge! wcount do |k, o, n|
-        o + n
-      end
-      true
-    end
-  end
-end
+require_relative 'hangman/clue'
+require_relative 'hangman/game'

data/lib/hangman/clue.rb

@@ -0,0 +1,63 @@
+module Hangman
+  class Clue
+    # A list of letters in the order you should try them
+    # Note that the order may change based on the next letter so the 
+    # only signinficant item, in ths list is the first one
+    attr_reader :guesses
+    # A list of words that could be the solution
+    attr_reader :possible_words
+    
+    # Create a new clue
+    # the clue format is a string with underscores for unknown letters
+    # Example: "he__o"
+    # The wrong letters is a list of letters that were guessed but aren't correct
+    def initialize(clue, wrong_letters)
+      @clue = clue.to_s.downcase
+      @wrong_letters = wrong_letters
+      @letter_counts = {}
+      @possible_words = []
+      @used_letters = @clue.split(//).reject { |c| c == "_" }
+    end
+    
+    # Pass a list of words to this method to come up wth the best next guess
+    # It will return true if there are any potential guesses
+    # You can call this method multiple times on a single Clue (if you have multiple wordlists this may be helpful)
+    def solve(words)
+      length = @clue.length
+      
+      words.each do |w|
+        w = w.chomp.downcase
+        next if w.size != length
+        next if @wrong_letters.any? { |c| w.include? c }
+
+        if match_word w
+          @possible_words << w
+        end
+      end
+      @guesses = @letter_counts.sort{ |a,b| b[1] <=> a[1] }.map{ |e| e[0] }
+      
+      return !@guesses.empty?
+    end
+    
+    private
+    
+    def match_word(w)
+      wcount = {}
+      @clue.each_char.with_index do |c, i|
+        if c == '_'
+          if @used_letters.include? w[i]
+            return false
+          end
+          wcount[w[i]] = 1 # equals instead of += because we want unique per word
+        elsif w[i] != c
+          return false
+        end
+      end
+      
+      @letter_counts.merge! wcount do |k, o, n|
+        o + n
+      end
+      true
+    end
+  end
+end

data/lib/hangman/game.rb

@@ -0,0 +1,48 @@
+module Hangman
+  class Game
+    # The word to guess
+    attr_reader :word
+    # A list of wrong characters guessed
+    attr_reader :wrong
+    # A list of correct characters guessed
+    attr_reader :correct
+    # The number of incorrect guesses
+    attr_reader :wrong_guesses
+
+    # Set the word this puzzle wil be for
+    def initialize(word)
+      @word = word
+      @wrong = []
+      @correct = []
+      @wrong_guesses = 0
+    end
+
+    # Guess a letter for the puzzle
+    def guess(c)
+      c = c.to_s.chr.upcase
+      if @word.upcase.include? c
+        if not @correct.include? c
+          @correct << c
+        end
+        true
+      else
+        if not @wrong.include? c
+          @wrong << c
+          @wrong_guesses += 1
+        end
+        false
+      end
+    end
+
+    # Whether or not the puzzle is completed
+    def solved?
+      @word.upcase.each_char.all? { |c| @correct.include? c }
+    end
+
+    # The word with only the correct guesses given. Others will be shown as '_'
+    def to_s
+      # There is probably a better way to do this...
+      @word.upcase.each_char.map { |c| @correct.include?(c) ? c : '_' }.join
+    end
+  end
+end

metadata

@@ -4,9 +4,9 @@ version: !ruby/object:Gem::Version
   prerelease: false
   segments: 
   - 0
-  - 0
   - 1
-  version: 0.0.1
+  - 1
+  version: 0.1.1
 platform: ruby
 authors: 
 - Ben Olive
@@ -14,7 +14,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-01-04 00:00:00 -05:00
+date: 2011-01-27 00:00:00 -05:00
 default_executable: 
 dependencies: []
 
@@ -28,6 +28,8 @@ extra_rdoc_files: []
 
 files: 
 - bin/hangman
+- lib/hangman/clue.rb
+- lib/hangman/game.rb
 - lib/hangman.rb
 has_rdoc: true
 homepage: http://github.com/sionide21/Hangman