boggle_solver 0.0.3 → 0.0.4

data/boggle_solver.gemspec

@@ -1,9 +1,12 @@
 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.markdown'))
+  s.description   = "Ruby program that employs graph theory to solve a word matrix puzzle (Boggle).
+
+# Introduction
+Boggle 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."
   s.requirements  = "[ 'An installed dictionary (most Unix systems have one)']"
-  s.version       = "0.0.3"
+  s.version       = "0.0.4"
   s.author        = "Casey Robinson"
   s.email         = "kc@rampantmonkey.com"
   s.homepage      = "http://rampantmonkey.com"

data/lib/boggle_solver/board.rb

@@ -6,21 +6,29 @@ module BoggleSolver
   class Board < AdjacencyMatrix
     attr_reader :words
 
-    def initialize(mode=:default)
+    def initialize(mode=:default, input, dictionary_file)
       super(25)
       connect
       @board = []
       if mode == :random
         @prng = Random.new
         generate_random_board
+      elsif mode == :given
+        @board = input.split(//)
       else
         generate_board
       end
+      calculate_board_hash
       puts self
       @words = []
+      set_dictionary dictionary_file
       load_dictionary
     end
 
+    def set_dictionary file
+      @dictionary_file = file
+    end
+
     def connect
       j=0;
       while j<25 do
@@ -38,13 +46,15 @@ module BoggleSolver
 
     def generate_board
       @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 load_board_from_string s
+      @board = s.split(//) if s.length == 25
     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
@@ -53,10 +63,9 @@ module BoggleSolver
     end
 
     def load_dictionary
-      dictionary_file = "/usr/share/dict/words"
       @dictionary = Array.new
 
-      File.foreach(dictionary_file) do |line|
+      File.foreach(@dictionary_file) do |line|
         next_word = line.chomp
         @dictionary.push next_word if possible? next_word
       end

data/lib/boggle_solver/options.rb

@@ -5,13 +5,14 @@ module BoggleSolver
 
     DEFAULT_DICTIONARY = "/usr/share/dict/words"
 
-    attr_reader :dictionary, :mode
+    attr_reader :dictionary, :mode, :input
 
     def initialize(argv)
       @dictionary = DEFAULT_DICTIONARY
       @mode = :default
       parse(argv)
-      @input = argv
+      @input = argv[0]
+      @mode = :given unless argv.empty?
     end
 
     def parse(argv)
@@ -29,7 +30,7 @@ module BoggleSolver
         end
 
         begin
-          argv = ["-h"] if argv.empty?
+          argv = ["-r"] if argv.empty?
           opts.parse!(argv)
         rescue OptionParser::ParseError => e
           STDERR.puts e.message, "\n", opts

data/lib/boggle_solver/runner.rb

@@ -9,7 +9,7 @@ module BoggleSolver
     end
 
     def run
-      board = Board.new(@options.mode)
+      board = Board.new(@options.mode,@options.input,@options.dictionary)
       board.find_words
       p board.words
     end

data/test/test_options.rb

@@ -0,0 +1,43 @@
+require 'test/unit'
+require 'shoulda'
+require_relative '../lib/boggle_solver/options'
+
+class TestOptions < Test::Unit::TestCase
+
+  context "specifying nothing" do
+    setup do
+      @opts = BoggleSolver::Options.new([])
+    end
+
+    should "return default dictionary" do
+      assert_equal BoggleSolver::Options::DEFAULT_DICTIONARY, @opts.dictionary
+    end
+
+    should "set mode to random" do
+      assert_equal @opts.mode, :random
+    end
+  end
+
+  context "specifying a dictionary" do
+    should "return it" do
+      opts = BoggleSolver::Options.new(["-d", "mydict"])
+      assert_equal "mydict", opts.dictionary
+    end
+  end
+
+  context "specifying the board with a string and nothing else" do
+    should "return the board" do
+      opts = BoggleSolver::Options.new(["abcdefghijklmnopqrstuvwxy"])
+      assert_equal "abcdefghijklmnopqrstuvwxy", opts.input
+      assert_equal opts.mode, :given
+    end
+  end
+
+  context "specifying the board with a string and an extra word" do
+    should "return only the board" do
+      opts = BoggleSolver::Options.new(["abcdefghijklmnopqrstuvwxy", "extra stuff"])
+      assert_equal "abcdefghijklmnopqrstuvwxy", opts.input
+      assert_equal opts.mode, :given
+    end
+  end
+end

metadata

@@ -2,7 +2,7 @@
 name: boggle_solver
 version: !ruby/object:Gem::Version
   prerelease:
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Casey Robinson
@@ -11,45 +11,22 @@ bindir: bin
 cert_chain: []
 date: 2012-05-15 00:00:00.000000000Z
 dependencies: []
-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"
+description: ! 'Ruby program that employs graph theory to solve a word matrix puzzle
+  (Boggle).
+
+
+  # Introduction
+
+  Boggle 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.'
 email: kc@rampantmonkey.com
 executables:
 - boggle_solver
 extensions: []
 extra_rdoc_files: []
 files:
-- boggle_solver-0.0.2.gem
 - boggle_solver.gemspec
 - README.markdown
 - bin/boggle_solver
@@ -59,8 +36,10 @@ files:
 - lib/boggle_solver/runner.rb
 - pkg/boggle_solver-0.0.1.gem
 - pkg/boggle_solver-0.0.2.gem
+- pkg/boggle_solver-0.0.3.gem
 - test/test_adjacency_matrix.rb
 - test/test_board.rb
+- test/test_options.rb
 homepage: http://rampantmonkey.com
 licenses: []
 post_install_message:
@@ -89,4 +68,5 @@ summary: Find all words in a letter matrix
 test_files:
 - test/test_adjacency_matrix.rb
 - test/test_board.rb
+- test/test_options.rb
 ...