hangman 0.0.1

data/bin/hangman

@@ -0,0 +1,31 @@
+#! /usr/bin/env ruby
+
+require 'hangman'
+
+# This works on OSX and Ubuntu
+# TODO add option to specify
+wordfile = "/usr/share/dict/words"
+
+if ARGV.size != 1 and ARGV.size != 2
+  $stderr.puts "Usage: #{$0} <clue> [wrong letters]"
+  $stderr.puts "\t Where clue is the clue with unknown letters replaced by _ (example: pa__word)"
+  exit -1
+end
+
+guess = ARGV[0]
+exc = []
+exc = ARGV[1].split // if ARGV.size == 2
+
+puzzle = Hangman::Clue.new guess, exc
+
+File.open wordfile, 'r' do |file|
+  if puzzle.solve file.each_line 
+    puts "#{puzzle.possible_words.size} potential words"
+    if puzzle.possible_words.size < 10
+      puts puzzle.possible_words
+    end
+    puts "Guess: #{puzzle.guesses.first}"
+  else
+    puts "No guesses!"
+  end
+end

data/lib/hangman.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

metadata

@@ -0,0 +1,66 @@
+--- !ruby/object:Gem::Specification 
+name: hangman
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- Ben Olive
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-01-04 00:00:00 -05:00
+default_executable: 
+dependencies: []
+
+description: "    Comes up with guesses to hangman puzzles.\n"
+email: ben.olive@gatech.edu
+executables: 
+- hangman
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- bin/hangman
+- lib/hangman.rb
+has_rdoc: true
+homepage: http://github.com/sionide21/Hangman
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 1
+      - 9
+      version: "1.9"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Solve hangman puzzles
+test_files: []
+