digits_solver 0.1.1 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: b539861e0a6120403802c85ac9fb08960aa17c7064687064269a2b59b6213f3d
-  data.tar.gz: c0a746b1c33a7866ed10b39e51ae672806f723b01336b81f63b0563a3b45fd05
+  metadata.gz: 3cc76291aaef108bc1e004bb3477fddd31520a414a82027be8111ef746add465
+  data.tar.gz: '08302397fba6f31c6c92e8a14e9817f8b2f308c7d0fb2c1e46b17b653a11d20c'
 SHA512:
-  metadata.gz: dd7f9d5a8c08a0ad227aa02f1adbdf12b331b69a9e068f8a1586d9e2867766b5bd6eed8c1d7bae93b57cabb310d6f637397aedf9471a5a2aecf1e07b88bea120
-  data.tar.gz: 0dcb86378227e3184e92b63af05fcd3b2cf210d18e0c3e1e4d92bbe973f333c68a47567ae2ba9bd023906fe673426353052e7a0f86d2c2752932e02875c646d3
+  metadata.gz: dd79298b33da986c95ad772b18c3cbad3c8827b2f7e3ab5c76a07fe6d17abb1247000c3d172e557ee78ebcef98bd71df73983348271fe76da0ecea5b240b7fb8
+  data.tar.gz: 7fe1e62a96ce0d064628857740f46e1b4b2d54e88a4988581d0524f614a3bf84a11130d9ad589a74fdfb1158a18a5b80f101d3d2f559dcc8d525e988a19367c3

data/.rubocop.yml

@@ -3,11 +3,11 @@ AllCops:
 
 Style/StringLiterals:
   Enabled: true
-  EnforcedStyle: double_quotes
+  EnforcedStyle: single_quotes
 
 Style/StringLiteralsInInterpolation:
   Enabled: true
   EnforcedStyle: double_quotes
 
 Layout/LineLength:
-  Max: 120
+  Max: 140

data/Gemfile

@@ -1,12 +1,6 @@
 # frozen_string_literal: true
 
-source "https://rubygems.org"
+source 'https://rubygems.org'
 
 # Specify your gem's dependencies in digits_solver.gemspec
 gemspec
-
-gem "rake", "~> 13.0"
-
-gem "rspec", "~> 3.0"
-
-gem "rubocop", "~> 1.21"

data/README.md

@@ -1,24 +1,35 @@
 # DigitsSolver
 
-This is basically a coding exercice.
+This is basically a coding exercise.
 
-The goal of this gem is to solve puzzles à-la [NY Times Digits game](https://www.nytimes.com/games/digits). You may 
-actually know this game under a different name. In France this looks like the calculation part of a 40 year old TV 
+The goal of this gem is to solve puzzles à-la [NY Times Digits game](https://www.nytimes.com/games/digits). You may
+actually know this game under a different name. In France this looks like the calculation part of an almost 50 year old TV
 show named 'Les chiffres et les lettres'...
 
-This gem implements a brute-force approach to solve the problem but is ready to host alternative strategies.
+The goal is to use numbers from the draw combined by any basic operation (+ - / *) to reach that goal. You cannot have negative numbers as result of "-" operation, and can only divide number resulting into an integer.
 
+This gem implements a brute-force approach to solve the problem but is ready to host alternate strategies.  
+Basically this strategy won't work beyond 7 numbers in the draw (it is limited in the command line to 6 numbers but not within
+the code), as for a 7 numbers draw it already takes few minutes on my machine. Although this strategy does not
+stop at the first encountered solution but browses the whole tree of possibilities (that could be easily done).
+
+To go beyond, you would probably have to go for a more mathematical approach...
 
 ## Installation
 
-    $ gem install digits_solver
+1. You need to have the [Ruby language](https://www.ruby-lang.org) working on your machine.
+2. Install this Ruby gem:
+
+        $ gem install digits_solver
 
 ## Usage
 
-This gem provides an executable named `find_nydigits_solutions`.
+### Command line
 
-* First argument is the target number.
-* All subsequent arguments are the numbers to be used in calculations to reach the target.
+Once this gem installed, it provides an executable named `find_nydigits_solutions`(you may potentially have to log-out/in if it is not available in your shell).
+
+* First script argument is the target number. 
+* All subsequent arguments are the numbers to be used in calculations to reach the target. You can specify from 2 to 6 numbers in the "draw".
 
 ex:
 
@@ -32,3 +43,81 @@ Solved in 4 operations:
  => 22 * 20 = 440
  => 440 - 3 = 437
 ```
+This program will only display the "best" solution found (ie the one implying the least number of operations), but code does not (you see here above that 67 solutions were found).
+
+### Code usage
+
+You have basically access to the same functions but with more flexibility.
+
+```ruby
+# The interface looks a lot like the command line, here as opposed to the command line
+# you are not limited to 6 numbers in the draw, but be aware that 7 takes already few minutes
+# and I never tried beyond...
+r = DigitsSolver.solve_for 437, 3, 5, 7, 13, 20, 25
+
+# The object returned is a DigitsSolver::SolutionSet
+# You can query it
+r.size
+# => 67
+
+# You can query the "best" solution found. It returns a DigitsSolver::Solution object.
+r.best_solution
+# => #<DigitsSolver::Solution:0x000055b96f5f97a8
+#  Solution: '(5 * 7 - 13) * 20 - 3 = 437',
+#  @problem_statement=#<DigitsSolver::ProblemStatement:0x000055b96fe71020 @draw=[3, 5, 7, 13, 20, 25], @max_operations_number=5, @target_number=437>,
+#  @operands=[5, 7, 13, 20, 3],
+#  @operations_to_apply=[:multiply, :minus, :multiply, :minus]>
+
+# Or you can query the "best" solutions, then it would return an array of DigitsSolver::Solution
+# 
+r.best_solutions 3
+# => [#<DigitsSolver::Solution:0x000055b96f5f97a8
+#   Solution: '(5 * 7 - 13) * 20 - 3 = 437',
+#   @problem_statement=#<DigitsSolver::ProblemStatement:0x000055b96fe71020 @draw=[3, 5, 7, 13, 20, 25], @max_operations_number=5, @target_number=437>,
+#   @operands=[5, 7, 13, 20, 3],
+#   @operations_to_apply=[:multiply, :minus, :multiply, :minus]>,
+#  #<DigitsSolver::Solution:0x000055b96f663ef0
+#   Solution: '(7 * 5 - 13) * 20 - 3 = 437',
+#   @problem_statement=#<DigitsSolver::ProblemStatement:0x000055b96fe71020 @draw=[3, 5, 7, 13, 20, 25], @max_operations_number=5, @target_number=437>,
+#   @operands=[7, 5, 13, 20, 3],
+#   @operations_to_apply=[:multiply, :minus, :multiply, :minus]>,
+#  #<DigitsSolver::Solution:0x000055b96f6b2528
+#   Solution: '((20 - 3) * 25 + 5) + 7 = 437',
+#   @problem_statement=#<DigitsSolver::ProblemStatement:0x000055b96fe71020 @draw=[3, 5, 7, 13, 20, 25], @max_operations_number=5, @target_number=437>,
+#   @operands=[20, 3, 25, 5, 7],
+#   @operations_to_apply=[:minus, :multiply, :plus, :plus]>]
+
+# DigitsSolver::Solution objects can be printed
+puts r.best_solution
+# Solved in 4 operations:
+#  => 5 * 7 = 35
+#  => 35 - 13 = 22
+#  => 22 * 20 = 440
+#  => 440 - 3 = 437
+# => nil
+
+# or debugged
+pp r.best_solution
+# #<DigitsSolver::Solution:0x000055b96f5f97a8
+#  Solution: '(5 * 7 - 13) * 20 - 3 = 437',
+#  @problem_statement=#<DigitsSolver::ProblemStatement:0x000055b96fe71020
+#   @draw=[3, 5, 7, 13, 20, 25],
+#   @max_operations_number=5,
+#   @target_number=437>,
+#  @operands=[5, 7, 13, 20, 3],
+#  @operations_to_apply=[:multiply, :minus, :multiply, :minus]>
+
+# And of course it has other methods, you could use. Ex:
+r.sorted_solutions.map(&:to_evaluable_code).take 10
+# => ["(5 * 7 - 13) * 20 - 3",
+#  "(7 * 5 - 13) * 20 - 3",
+#  "((20 - 3) * 25 + 5) + 7",
+#  "((20 - 3) * 25 + 7) + 5",
+#  "((20 - 5) + 3) * 25 - 13",
+#  "((20 - 7) + 5) * 25 - 13",
+#  "((3 * 5 + 20) * 13 + 7) - 25",
+#  "((3 * 5 + 20) * 13 - 25) + 7",
+#  "((3 * 7 * 20 + 5) - 13) + 25",
+#  "((3 * 7 * 20 + 5) + 25) - 13"]
+
+```

data/Rakefile

@@ -1,12 +1,12 @@
 # frozen_string_literal: true
 
-require "bundler/gem_tasks"
-require "rspec/core/rake_task"
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
 
 RSpec::Core::RakeTask.new(:spec)
 
-require "rubocop/rake_task"
+require 'rubocop/rake_task'
 
 RuboCop::RakeTask.new
 
-task default: %i[spec rubocop]
+task default: %i[spec]

data/digits_solver.gemspec

@@ -1,39 +1,43 @@
 # frozen_string_literal: true
 
-require_relative "lib/digits_solver/version"
+require_relative 'lib/digits_solver/version'
 
 Gem::Specification.new do |spec|
-  spec.name = "digits_solver"
+  spec.name = 'digits_solver'
   spec.version = DigitsSolver::VERSION
-  spec.authors = ["Laurent B."]
-  spec.email = ["lbnetid+rb@gmail.com"]
+  spec.authors = ['Laurent B.']
+  spec.email = ['lbnetid+rb@gmail.com']
 
-  spec.summary = "Solves NYTimes Digits puzzle."
-  spec.description = "Finds solutions to the NYTimes Digits game."
-  spec.homepage = "https://gitlab.com/coding_exercices/digits_solver"
-  spec.required_ruby_version = ">= 2.6.0"
+  spec.summary = 'Solves NYTimes Digits puzzle.'
+  spec.description = 'Finds solutions to the NYTimes Digits game.'
+  spec.homepage = 'https://gitlab.com/coding_exercices/digits_solver'
+  spec.required_ruby_version = '>= 2.6.0'
 
-  spec.metadata["allowed_push_host"] = "https://rubygems.org"
+  spec.metadata['allowed_push_host'] = 'https://rubygems.org'
 
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = spec.homepage
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  # noinspection RubyMismatchedArgumentType
   spec.files = Dir.chdir(__dir__) do
     `git ls-files -z`.split("\x0").reject do |f|
       (f == __FILE__) || f.match(%r{\A(?:(?:bin|test|spec|features)/|\.(?:git|circleci)|appveyor)})
     end
   end
-  spec.bindir = "exe"
+  spec.bindir = 'exe'
   spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib"]
+  spec.require_paths = ['lib']
 
   # Uncomment to register a new dependency of your gem
   # spec.add_dependency "example-gem", "~> 1.0"
   spec.add_development_dependency 'pry'
-  spec.add_development_dependency 'rspec'
-
+  spec.add_development_dependency 'rake', '~> 13.0'
+  spec.add_development_dependency 'rspec', '~> 3.0'
+  spec.add_development_dependency 'rubocop', '~> 1.21'
+  spec.add_development_dependency 'rubocop-rake'
+  spec.add_development_dependency 'rubocop-rspec'
   # For more information and examples about making a new gem, check out our
   # guide at: https://bundler.io/guides/creating_gem.html
 end

data/exe/find_nydigits_solutions

@@ -1,18 +1,18 @@
 #!/usr/bin/env ruby
-# coding: utf-8
+# frozen_string_literal: true
 
 require 'rubygems'
 require 'bundler/setup'
 require 'digits_solver'
 
-def help(out = STDOUT)
-  out.puts <<EOM
-To run this program:
+def help(out = $stdout)
+  out.puts <<~EOM
+    To run this program:
 
-find_nydigits_solution <number to find> <space separated list of numbers>
+    find_nydigits_solution <number to find> <space separated list of numbers>
 
-This program will solve if possible the NY Digits puzzle.
-EOM
+    This program will solve if possible the NY Digits puzzle.
+  EOM
 end
 
 begin
@@ -26,11 +26,11 @@ begin
   end
   puts "Trying to find #{target}"
   solutions = DigitsSolver.solve_for target, *draw
-  raise DigitsSolver::Error, %q[Couldn't find any solution !] if solutions.sorted_solutions.empty?
+  raise DigitsSolver::Error, "Couldn't find any solution !" if solutions.sorted_solutions.empty?
 
   puts "A best solution has been found (total of #{solutions.size} possible solutions found)."
   puts solutions.best_solution
-rescue => e
-  STDERR.puts e.message
-  help STDERR
+rescue StandardError => e
+  warn e.message
+  help $stderr
 end

data/lib/digits_solver/error.rb

@@ -1,4 +1,5 @@
 # frozen_string_literal: true
+
 module DigitsSolver
-  class Error < StandardError ; end
+  class Error < StandardError; end
 end

data/lib/digits_solver/problem_statement.rb

@@ -1,18 +1,19 @@
 # frozen_string_literal: true
+
 module DigitsSolver
   class ProblemStatement
-
     attr_reader :target_number
 
     def draw
       @draw.dup
     end
 
+    # noinspection RubyParameterNamingConvention
     def initialize(target_number_or_problem_statement, *draw)
       @target_number, @draw = if target_number_or_problem_statement.is_a? DigitsSolver::ProblemStatement
-                            [target_number_or_problem_statement.target_number, target_number_or_problem_statement.draw]
-                          else
-                            [target_number_or_problem_statement, draw]
+                                [target_number_or_problem_statement.target_number, target_number_or_problem_statement.draw]
+                              else
+                                [target_number_or_problem_statement, draw]
                               end
       DigitsSolver.logger.info "The target is #{target_number}"
       DigitsSolver.logger.info "The draw is #{draw.inspect}"
@@ -21,6 +22,5 @@ module DigitsSolver
     def max_operations_number
       @max_operations_number ||= @draw.size - 1
     end
-
   end
 end

data/lib/digits_solver/solution.rb

@@ -1,31 +1,30 @@
 # frozen_string_literal: true
+
 module DigitsSolver
 
+  # This is the class that represents a solution to the problem.
   class Solution
-
     include DigitsSolver::Strategies::Base
 
     attr_reader :problem_statement, :operands, :operations_to_apply
 
     def initialize(problem_statement, operands, operations_to_apply)
-      raise DigitsSolver::Error, "Invalid problem statement" unless problem_statement.is_a? DigitsSolver::ProblemStatement
+      raise DigitsSolver::Error, 'Invalid problem statement' unless problem_statement.is_a? DigitsSolver::ProblemStatement
       unless operands.size == operations_to_apply.size + 1
         raise DigitsSolver::Error, "Invalid solution #{operands.inspect} => #{operations_to_apply.inspect}"
       end
 
-      DigitsSolver.logger.info "New solution: #{self.inspect}"
-
       @problem_statement = problem_statement
       @operands = operands
       @operations_to_apply = operations_to_apply
     end
 
-    def ==(other_solution)
-      (operations_to_apply == other_solution.operations_to_apply) && (operands == other_solution.operands)
+    def ==(other)
+      (operations_to_apply == other.operations_to_apply) && (operands == other.operands)
     end
 
     def to_s
-      res = ["Solved in #{operations_to_apply.size} operation#{operations_to_apply.size <= 1 ? '' : 's'}:"]
+      res = ["Solved in #{operations_to_apply.size} operation#{operations_to_apply.size <= 1 ? "" : "s"}:"]
       res.concat to_operation_lines
       res.join "\n"
     end
@@ -50,23 +49,22 @@ module DigitsSolver
         pp.text "Solution: '#{to_evaluable_code} = #{problem_statement.target_number}'"
         pp.text ','
         pp.breakable
-        pp.seplist(self.instance_variables) do |v|
+        pp.seplist(instance_variables) do |v|
           pp.text "#{v}="
-          pp.pp self.instance_variable_get v
+          pp.pp instance_variable_get v
         end
       end
     end
 
     def to_evaluable_code
-      res = operations_to_apply.each.with_index.reduce(operands.first) do |res, (operation, idx)|
+      # parenthesis management is ... meh, but better than nothing, and at least mathematically correct.
+      evaluable_code = operations_to_apply.each.with_index.reduce(operands.first) do |res, (operation, idx)|
         op1 = res
         op2 = operands[idx + 1]
         format_string = operation == :multiply ? '%s %s %u' : '(%s %s %u)'
         format(format_string, op1, DigitsSolver::Strategies::Base::OPERATIONS[operation], op2)
       end
-      res[-1] == ')' ? res[1...-1] : res
+      evaluable_code[-1] == ')' ? evaluable_code[1...-1] : evaluable_code
     end
-
   end
-
 end

data/lib/digits_solver/solution_set.rb

@@ -1,20 +1,19 @@
-module DigitsSolver
+# frozen_string_literal: true
 
+module DigitsSolver
   class SolutionSet
-
     include Enumerable
 
     DEFAULT_STRATEGY = DigitsSolver::Strategies::BruteForce
-    attr_reader :problem_statement, :strategy
+    attr_reader :problem_statement, :strategy, :count
 
     class << self
-
       def solve_for(problem_statement, strategy: DEFAULT_STRATEGY)
         extend strategy
-        solutions = solve(problem_statement)
+        solutions, attempts_count = solve(problem_statement)
+        DigitsSolver.logger.info "Found #{solutions.count} potentially non unique solutions amongst #{attempts_count} tries."
         new problem_statement, solutions, strategy
       end
-
     end
 
     def each(&block)
@@ -37,6 +36,7 @@ module DigitsSolver
                              .take(nb)
       nb == 1 ? res.first : res
     end
+
     alias best_solutions best_solution
 
     def size
@@ -57,7 +57,7 @@ module DigitsSolver
     end
 
     def initialize(problem_statement, solutions, strategy)
-      raise DigitsSolver::Error, "Invalid problem statement" unless problem_statement.is_a? DigitsSolver::ProblemStatement
+      raise DigitsSolver::Error, 'Invalid problem statement' unless problem_statement.is_a? DigitsSolver::ProblemStatement
 
       @problem_statement = problem_statement
       @strategy = strategy
@@ -65,12 +65,20 @@ module DigitsSolver
       @indexed_solutions = {}
       @solutions = []
 
-      solutions.each do |solution|
-        self << solution
+      DigitsSolver.logger.info "#{solutions.count} candidate solutions"
+      discarded_nb = solutions.reduce(0) do |count, solution|
+        if self << solution
+          DigitsSolver.logger.debug "New solution added to solution set: #{solution.to_evaluable_code}"
+          count
+        else
+          count + 1
+        end
       end
-
+      DigitsSolver.logger.info "Discarded: #{discarded_nb}"
+      msg = "Added #{self.solutions.count} solutions to the set of solutions, "
+      msg += discarded_nb.zero? ? 'none' : discarded_nb.to_s
+      msg += ' were discarded'
+      DigitsSolver.logger.info msg
     end
-
   end
-
 end

data/lib/digits_solver/strategies/base.rb

@@ -1,8 +1,9 @@
+# frozen_string_literal: true
+
 module DigitsSolver
   module Strategies
 
     module Base
-
       class OperationError < StandardError; end
 
       OPERATIONS = {
@@ -18,12 +19,13 @@ module DigitsSolver
 
       protected
 
+      # noinspection RubyInstanceMethodNamingConvention,RubyParameterNamingConvention
       def possible_operations_for_ordered_draw(max_operations_number)
         nb_operations = OPERATIONS.size
         ops_a = OPERATIONS.to_a
-        number_of_possibilities = nb_operations ** max_operations_number
+        number_of_possibilities = nb_operations**max_operations_number
 
-        DigitsSolver.logger.info "number of operations permutations: #{number_of_possibilities}, nb op: #{nb_operations}"
+        DigitsSolver.logger.info "The number of operations permutations for the #{nb_operations} basic operations and a draw of #{max_operations_number + 1} numbers (ie #{max_operations_number} consecutive operations) is #{number_of_possibilities}."
 
         (0...number_of_possibilities).map do |i|
           i.to_s(nb_operations)
@@ -33,6 +35,7 @@ module DigitsSolver
         end
       end
 
+      # noinspection RubyInstanceMethodNamingConvention
       def apply_operations_chain_to_ordered_draw(operations_chain, ordered_draw, problem_statement)
         operations_chain.each.with_index.reduce(ordered_draw.first) do |acc, (operation, idx)|
           cur_op_res = apply_operation_to_operands(operation, acc, ordered_draw[idx + 1])
@@ -40,16 +43,16 @@ module DigitsSolver
             ops = operations_chain.take(idx + 1)
             operands = ordered_draw.take(idx + 2)
             yield DigitsSolver::Solution.new(problem_statement, operands, ops)
-            break
+            return cur_op_res
+
           end
           cur_op_res
         end
       end
 
-      def apply_operation_to_operands (operation, operand1, operand2)
-        res = send(operation, operand1, operand2)
-        DigitsSolver.logger.debug "#{operand1} #{OPERATIONS[operation]} #{operand2} = #{res}"
-        res
+      def apply_operation_to_operands(operation, operand1, operand2)
+        # wow that's a useful one ;-), at least more understandable
+        send operation, operand1, operand2
       end
 
       def plus(a, b)
@@ -67,11 +70,13 @@ module DigitsSolver
       end
 
       def divide(a, b)
-        raise DigitsSolver::Strategies::Base::OperationError, "#{a} / #{b} is not allowed as result would not be an integer" unless a % b == 0
+        unless (a % b).zero?
+          raise DigitsSolver::Strategies::Base::OperationError,
+                "#{a} / #{b} is not allowed as result would not be an integer"
+        end
 
         a / b
       end
-
     end
   end
 end

data/lib/digits_solver/strategies/brute_force.rb

@@ -1,8 +1,8 @@
+# frozen_string_literal: true
+
 module DigitsSolver
   module Strategies
-
     module BruteForce
-
       include DigitsSolver::Strategies::Base
 
       def solve(problem_statement)
@@ -10,27 +10,24 @@ module DigitsSolver
         draw = problem_statement.draw
         possible_operations = possible_operations_for_ordered_draw problem_statement.max_operations_number
         # DigitsSolver.logger.debug possible_operations.inspect
+        attempts_count = 0
 
         draw.permutation.map do |ordered_draw|
-
-          DigitsSolver.logger.debug ordered_draw.inspect
+          DigitsSolver.logger.debug "Testing #{ordered_draw.inspect} for all possible chains of operations"
           possible_operations.each do |operations_chain|
-            DigitsSolver.logger.debug operations_chain.inspect
+            attempts_count += 1
             begin
               apply_operations_chain_to_ordered_draw(operations_chain, ordered_draw, problem_statement) do |valid_solution|
                 solutions << valid_solution
               end
-            rescue DigitsSolver::Strategies::Base::OperationError => dsboe
-              DigitsSolver.logger.debug "#{ordered_draw.inspect} => #{operations_chain.inspect} is discarded because #{dsboe.message}"
+            rescue DigitsSolver::Strategies::Base::OperationError => e
+              DigitsSolver.logger.debug "#{ordered_draw.inspect} => #{operations_chain.inspect} is discarded because #{e.message}"
             end
           end
-
         end
-        DigitsSolver.logger.info "Solutions: #{solutions.inspect}"
-        solutions
+        DigitsSolver.logger.debug "Found #{solutions.count} solutions."
+        [solutions, attempts_count]
       end
-
     end
-
   end
-end
+end

data/lib/digits_solver/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module DigitsSolver
-  VERSION = '0.1.1'.freeze
+  VERSION = '0.1.3'
 end

data/lib/digits_solver.rb

@@ -1,11 +1,11 @@
 # frozen_string_literal: true
 
-require_relative "digits_solver/version"
-require_relative "digits_solver/error"
-require_relative "digits_solver/problem_statement"
-require_relative "digits_solver/strategies/base"
-require_relative "digits_solver/strategies/brute_force"
-require_relative "digits_solver/solution"
+require_relative 'digits_solver/version'
+require_relative 'digits_solver/error'
+require_relative 'digits_solver/problem_statement'
+require_relative 'digits_solver/strategies/base'
+require_relative 'digits_solver/strategies/brute_force'
+require_relative 'digits_solver/solution'
 require_relative 'digits_solver/solution_set'
 
 module DigitsSolver

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: digits_solver
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.3
 platform: ruby
 authors:
 - Laurent B.
@@ -24,8 +24,64 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
 - !ruby/object:Gem::Dependency
   name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: rubocop
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.21'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.21'
+- !ruby/object:Gem::Dependency
+  name: rubocop-rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rubocop-rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
@@ -83,7 +139,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.3.26
+rubygems_version: 3.1.6
 signing_key: 
 specification_version: 4
 summary: Solves NYTimes Digits puzzle.