boggle_solver 0.0.2 → 0.0.3

data/boggle_solver.gemspec

@@ -1,9 +1,9 @@
 Gem::Specification.new do |s|
   s.name          = "boggle_solver"
   s.summary       = "Find all words in a letter matrix"
-  s.description   = "File.read(File.join(File.dirname(__FILE__), 'README'))"
+  s.description   = File.read(File.join(File.dirname(__FILE__), 'README.markdown'))
   s.requirements  = "[ 'An installed dictionary (most Unix systems have one)']"
-  s.version       = "0.0.2"
+  s.version       = "0.0.3"
   s.author        = "Casey Robinson"
   s.email         = "kc@rampantmonkey.com"
   s.homepage      = "http://rampantmonkey.com"

data/lib/boggle_solver/board.rb

@@ -6,13 +6,18 @@ module BoggleSolver
   class Board < AdjacencyMatrix
     attr_reader :words
 
-    def initialize
+    def initialize(mode=:default)
       super(25)
       connect
       @board = []
-#       @prng = Random.new
+      if mode == :random
+        @prng = Random.new
+        generate_random_board
+      else
+        generate_board
+      end
+      puts self
       @words = []
-      generate_board
       load_dictionary
     end
 
@@ -32,10 +37,19 @@ module BoggleSolver
     end
 
     def generate_board
-  #     @board.map!{|item| (65.+rand(25)).chr}
-    @board = ["a", "r", "t", "a", "c", "c", "e", "a", "r", "d", "f", "e", "w", "o", "o", "n", "p", "l", "m", "i", "c", "r", "u", "b", "l"]
-    @board_hash = Hash.new(0)
-    @board.each {|letter| @board_hash[letter]  += 1}
+      @board = ["a", "r", "t", "a", "c", "c", "e", "a", "r", "d", "f", "e", "w", "o", "o", "n", "p", "l", "m", "i", "c", "r", "u", "b", "l"]
+      calculate_board_hash
+    end
+
+    def generate_random_board
+      @board = Array.new(25)
+      @board.map!{|item| (65.+rand(25)).chr.downcase!}
+      calculate_board_hash
+    end
+
+    def calculate_board_hash
+      @board_hash = Hash.new(0)
+      @board.each {|letter| @board_hash[letter]  += 1}
     end
 
     def load_dictionary

data/lib/boggle_solver/options.rb

@@ -1,6 +1,41 @@
 require 'optparse'
 
-module Anagram
+module BoggleSolver
   class Options
 
     DEFAULT_DICTIONARY = "/usr/share/dict/words"
+
+    attr_reader :dictionary, :mode
+
+    def initialize(argv)
+      @dictionary = DEFAULT_DICTIONARY
+      @mode = :default
+      parse(argv)
+      @input = argv
+    end
+
+    def parse(argv)
+      OptionParser.new do |opts|
+        opts.banner = "Usage:   boggle_solver [ options ] "
+        opts.on("-d", "--dict path",  String, "Path to dictionary") do |dict|
+          @dictionary = dict
+        end
+        opts.on("-h", "--help", "Show this message") do
+          puts opts
+          exit
+        end
+        opts.on("-r", "--random", "Use a random board") do
+          @mode = :random
+        end
+
+        begin
+          argv = ["-h"] if argv.empty?
+          opts.parse!(argv)
+        rescue OptionParser::ParseError => e
+          STDERR.puts e.message, "\n", opts
+          exit(-1)
+        end
+      end
+    end
+  end
+end

data/lib/boggle_solver/runner.rb

@@ -1,14 +1,15 @@
 require_relative 'board'
+require_relative 'options'
 
 module BoggleSolver
 
   class Runner
     def initialize(argv)
-      #Parse options here
+      @options = Options.new(argv)
     end
 
     def run
-      board = Board.new
+      board = Board.new(@options.mode)
       board.find_words
       p board.words
     end

metadata

@@ -1,58 +1,92 @@
 --- !ruby/object:Gem::Specification
 name: boggle_solver
 version: !ruby/object:Gem::Version
-  version: 0.0.2
-  prerelease: 
+  prerelease:
+  version: 0.0.3
 platform: ruby
 authors:
 - Casey Robinson
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2012-05-15 00:00:00.000000000 Z
+date: 2012-05-15 00:00:00.000000000Z
 dependencies: []
-description: File.read(File.join(File.dirname(__FILE__), 'README'))
+description: ! "Ruby program that employs graph theory to solve a word matrix puzzle\
+  \ (Boggle).\n\n# Introduction\nBoggle Master consists of a 5x5 grid of letters.\
+  \ The goal of the game is to make as many words as possible from this grid by connecting\
+  \ neighboring letters. To generate a random puzzle the game uses 25 dice with letters\
+  \ on each side. The dice are shaken and each fall into a slot in the grid.\n\n#\
+  \ Example Grid\n\nBelow is an example grid. One possible word in this graph is `wear`.\
+  \ Arrows are added for convenience.\n\n     J   O   X   T   Y\n\n     A   C   D\
+  \   F   P\n\n     Y   K   B   E   O\n\n     A   M   G   P   W\n                \
+  \     |\n     D   S   R<--A<--E\n\nThe goal of this project is to find all possible\
+  \ words. Mostly to serve as a benchmark with which to compare my performance.\n\n\
+  \n# Coordinate System\nBelow are the indicies used to represent the dice in the\
+  \ board:\n\n     0   1   2   3   4\n     5   6   7   8   9\n    10  11  12  13 \
+  \ 14\n    15  16  17  18  19\n    20  21  22  23  24\n\n# Connection Matrix\nAdjacency\
+  \ matrix representing the connections in Boggle:\n\n    0 1 0 0 0 1 1 0 0 0 0 0\
+  \ 0 0 0 0 0 0 0 0 0 0 0 0 0\n    1 0 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\
+  \ 0\n    0 1 0 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n    0 0 1 0 1 0 0 1\
+  \ 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n    0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0\
+  \ 0 0 0 0 0\n    1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0\n    1 1 1 0\
+  \ 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0\n    0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0\
+  \ 0 0 0 0 0 0 0 0 0\n    0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0\n   \
+  \ 0 0 0 1 1 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0\n    0 0 0 0 0 1 1 0 0 0 0 1\
+  \ 0 0 0 1 1 0 0 0 0 0 0 0 0\n    0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0\
+  \ 0\n    0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0\n    0 0 0 0 0 0 0 1\
+  \ 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0\n    0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 1\
+  \ 0 0 0 0 0\n    0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0\n    0 0 0 0\
+  \ 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0\n    0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0\
+  \ 1 0 1 0 0 1 1 1 0\n    0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1\n   \
+  \ 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 1\n    0 0 0 0 0 0 0 0 0 0 0 0\
+  \ 0 0 0 1 1 0 0 0 0 1 0 0 0\n    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0\
+  \ 0\n    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0\n    0 0 0 0 0 0 0 0\
+  \ 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 1\n    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1\
+  \ 0 0 0 1 0\n"
 email: kc@rampantmonkey.com
 executables:
 - boggle_solver
 extensions: []
 extra_rdoc_files: []
 files:
-- bin/boggle_solver
-- boggle_solver-0.0.1.gem
+- boggle_solver-0.0.2.gem
 - boggle_solver.gemspec
+- README.markdown
+- bin/boggle_solver
 - lib/boggle_solver/adjacency_matrix.rb
 - lib/boggle_solver/board.rb
 - lib/boggle_solver/options.rb
 - lib/boggle_solver/runner.rb
-- README.markdown
+- pkg/boggle_solver-0.0.1.gem
+- pkg/boggle_solver-0.0.2.gem
 - test/test_adjacency_matrix.rb
 - test/test_board.rb
 homepage: http://rampantmonkey.com
 licenses: []
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '1.9'
-required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
+required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+  none: false
 requirements:
 - ! '[ ''An installed dictionary (most Unix systems have one)'']'
-rubyforge_project: 
-rubygems_version: 1.8.22
-signing_key: 
+rubyforge_project:
+rubygems_version: 1.8.15
+signing_key:
 specification_version: 3
 summary: Find all words in a letter matrix
 test_files:
 - test/test_adjacency_matrix.rb
 - test/test_board.rb
+...