solve_sudoku 0.1.0

data/LICENSE

@@ -0,0 +1,8 @@
+Copyright (C) 2012 David Trasbo
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+

data/README.md

@@ -0,0 +1,39 @@
+Solve Sudoku
+============
+
+Accepts a Sudoku puzzle (a partially completed grid) and outputs all possible solutions. The algorithm is based on this article: http://garethrees.org/2007/06/10/zendoku-generation/
+
+Usage
+-----
+
+`solve_sudoku puzzle.txt`
+
+RubyGems makes the executable available automatically. Otherwise,
+the executable lives in `bin/`.
+
+Examples in `puzzles/`. Use `puzzles/blank.txt` as a template for new
+puzzles.
+
+Installation
+------------
+
+As a gem:
+
+`gem install solve_sudoku`
+
+Alternatively, clone the repository for easier access to example
+puzzles:
+
+`git clone https://github.com/dtrasbo/solve_sudoku.git`
+
+Compatibility
+-------------
+
+Developed and tested using Ruby 1.9.3-p125.
+
+License
+-------
+
+Copyright (C) 2012 David Trasbo. Released under the MIT License. Please
+refer to `LICENSE`.
+

data/bin/solve_sudoku

@@ -0,0 +1,32 @@
+#!/usr/bin/env ruby
+
+require 'rubygems' # For 1.8.7 compatibility.
+require 'bundler/setup'
+require 'solve_sudoku'
+
+input = ARGF.read
+counter = 0
+
+begin
+  Sudoku::SolutionSet.new(input).each do |solution|
+    puts "\e[37m#{'-' * 35}\e[0m"
+    puts "\e[1mSolution ##{counter += 1}\e[0m"
+    puts
+    puts solution
+    puts
+    puts
+  end
+rescue Sudoku::SolutionSet::Process::OutOfHistory
+  print "\e[1m"
+
+  if counter.zero?
+    puts "\e[31mThe puzzle is unsolvable."
+  elsif counter == 1
+    puts "\e[32mThe input is a proper puzzle."
+  else
+    puts "\e[33mThe puzzle has multiple solutions.\e[0m"
+  end
+
+  print "\e[0m"
+end
+

data/lib/solve_sudoku.rb

@@ -0,0 +1,2 @@
+require 'sudoku/solution_set'
+

data/lib/sudoku/grid/cell.rb

@@ -0,0 +1,24 @@
+module Sudoku
+  class Grid
+    class Cell
+      attr_reader :value
+
+      def initialize(grid, value)
+        @grid, @value = grid, value
+      end
+
+      def filled?
+        !(@value.nil? || @value.zero?)
+      end
+
+      def column
+        @grid.column(self)
+      end
+
+      def row
+        @grid.row(self)
+      end
+    end
+  end
+end
+

data/lib/sudoku/grid.rb

@@ -0,0 +1,56 @@
+require 'sudoku/grid/cell'
+
+module Sudoku
+  class Grid
+    def initialize(string=nil)
+      @rows = if string
+        string.split($/).collect { |row|
+          row.split(',').collect { |value| Cell.new(self, value.to_i) }
+        }
+      else
+        (1..9).collect { |n| [] }
+      end
+    end
+
+    def []=(column, row, value)
+      @rows[row - 1][column - 1] = value
+    end
+
+    def cells
+      @rows.flatten
+    end
+
+    def filled_cells
+      cells.select { |c| c.filled? }
+    end
+
+    def column(cell)
+      row = @rows.find { |r| r.include?(cell) }
+      row.index(cell) + 1
+    end
+
+    def row(cell)
+      row = @rows.find { |r| r.include?(cell) }
+      @rows.index(row) + 1
+    end
+
+    def to_s
+      row_divider = (1..3).collect { "\e[37m---|---|---\e[0m" }.join('|')
+      row_divider = "\n#{row_divider}\n"
+
+      row_group_divider = (1..3).collect { '-' * 11 }.join('+')
+      row_group_divider = "\n#{row_group_divider}\n"
+
+      [0..2, 3..5, 6..8].collect { |row_group|
+        @rows[row_group].collect { |row|
+          [0..2, 3..5, 6..8].collect { |col_group|
+            col_group.collect { |column|
+              " #{row[column] || ' '} "
+            }.join("\e[37m|\e[0m")
+          }.join('|')
+        }.join(row_divider)
+      }.join(row_group_divider)
+    end
+  end
+end
+

data/lib/sudoku/solution_set/choice.rb

@@ -0,0 +1,12 @@
+module Sudoku
+  class SolutionSet
+    class Choice
+      attr_reader :column, :row, :value
+
+      def initialize(column, row, value)
+        @column, @row, @value = column, row, value
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/constraints/box_must_contain_value.rb

@@ -0,0 +1,18 @@
+module Sudoku
+  class SolutionSet
+    module Constraints
+      class BoxMustContainValue
+        def initialize(box_x, box_y, value)
+          @box_x, @box_y, @value = box_x, box_y, value
+        end
+
+        def satisfied_by?(choice)
+          choice.column.between?(@box_x * 3 - 2, @box_x * 3) &&
+            choice.row.between?(@box_y * 3 - 2, @box_y * 3) &&
+            choice.value == @value
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/constraints/cell_must_be_filled.rb

@@ -0,0 +1,16 @@
+module Sudoku
+  class SolutionSet
+    module Constraints
+      class CellMustBeFilled
+        def initialize(column, row)
+          @column, @row = column, row
+        end
+
+        def satisfied_by?(choice)
+          choice.column == @column && choice.row == @row
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/constraints/column_must_contain_value.rb

@@ -0,0 +1,16 @@
+module Sudoku
+  class SolutionSet
+    module Constraints
+      class ColumnMustContainValue
+        def initialize(column, value)
+          @column, @value = column, value
+        end
+
+        def satisfied_by?(choice)
+          choice.column == @column && choice.value == @value
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/constraints/row_must_contain_value.rb

@@ -0,0 +1,16 @@
+module Sudoku
+  class SolutionSet
+    module Constraints
+      class RowMustContainValue
+        def initialize(row, value)
+          @row, @value = row, value
+        end
+
+        def satisfied_by?(choice)
+          choice.row == @row && choice.value == @value
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/constraints.rb

@@ -0,0 +1,5 @@
+require 'sudoku/solution_set/constraints/cell_must_be_filled'
+require 'sudoku/solution_set/constraints/column_must_contain_value'
+require 'sudoku/solution_set/constraints/row_must_contain_value'
+require 'sudoku/solution_set/constraints/box_must_contain_value'
+

data/lib/sudoku/solution_set/process/out_of_history.rb

@@ -0,0 +1,9 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      class OutOfHistory < StandardError
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/step.rb

@@ -0,0 +1,63 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      class Step
+        attr_reader :output
+
+        def initialize(solution_set)
+          @solution_set = solution_set
+        end
+
+        def take(input=nil)
+          @input ||= input
+          @output = take!(*[@input].compact)
+        end
+
+        def take!(*args)
+          raise NotImplementedError, "#{self.class}#take! not implemented"
+        end
+
+        def revert
+          revert!
+        end
+
+        def revert!
+          raise NotImplementedError, "#{self.class}#revert! not implemented"
+        end
+
+        def retry?
+          @output
+        end
+
+        def constraints
+          @solution_set.constraints
+        end
+
+        def excluded_choices
+          @solution_set.excluded_choices
+        end
+
+        def included_choices
+          @solution_set.included_choices
+        end
+
+        def include_choice(choice)
+          @solution_set.include_choice(choice)
+        end
+
+        def exclude_choice(choice)
+          @solution_set.exclude_choice(choice)
+        end
+
+        def restore_excluded_choices(choices)
+          @solution_set.restore_excluded_choices(choices)
+        end
+
+        def delete_excluded_choices_if(&block)
+          @solution_set.delete_excluded_choices_if(&block)
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/steps/delete_redundant_choices.rb

@@ -0,0 +1,26 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      module Steps
+        class DeleteRedundantChoices < Step
+          def take!(choice)
+            satisfied_constraints = constraints.select { |constraint|
+              constraint.satisfied_by?(choice)
+            }
+
+            delete_excluded_choices_if do |excluded_choice|
+              satisfied_constraints.any? { |satisfied_constraint|
+                satisfied_constraint.satisfied_by?(excluded_choice)
+              }
+            end
+          end
+
+          def revert!
+            restore_excluded_choices(output)
+          end
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/steps/move_choice_into_included_set.rb

@@ -0,0 +1,18 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      module Steps
+        class MoveChoiceIntoIncludedSet < Step
+          def take!(choice)
+            include_choice(choice)
+          end
+
+          def revert!
+            exclude_choice(output)
+          end
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/steps/pick_choice_satisfying_constraint.rb

@@ -0,0 +1,25 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      module Steps
+        class PickChoiceSatisfyingConstraint < Step
+          def take!(constraint)
+            candidates = excluded_choices.select { |excluded_choice|
+              constraint.satisfied_by?(excluded_choice)
+            }
+
+            if retry?
+              candidates.slice!(0..candidates.index(output))
+            end
+
+            candidates.first
+          end
+
+          def revert!
+          end
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/steps/pick_unsatisfied_constraint.rb

@@ -0,0 +1,31 @@
+module Sudoku
+  class SolutionSet
+    class Process
+      module Steps
+        class PickUnsatisfiedConstraint < Step
+          def take!(input=nil)
+            candidates = constraints.select { |constraint|
+              included_choices.none? { |included_choice|
+                constraint.satisfied_by?(included_choice)
+              }
+            }
+
+            if candidates.any?
+              candidates.min_by { |constraint|
+                excluded_choices.select { |excluded_choice|
+                  constraint.satisfied_by?(excluded_choice)
+                }.size
+              }
+            else
+              :solved
+            end
+          end
+
+          def revert!
+          end
+        end
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set/process/steps.rb

@@ -0,0 +1,7 @@
+require 'sudoku/solution_set/process/step'
+
+require 'sudoku/solution_set/process/steps/pick_unsatisfied_constraint'
+require 'sudoku/solution_set/process/steps/pick_choice_satisfying_constraint'
+require 'sudoku/solution_set/process/steps/move_choice_into_included_set'
+require 'sudoku/solution_set/process/steps/delete_redundant_choices'
+

data/lib/sudoku/solution_set/process.rb

@@ -0,0 +1,113 @@
+require 'sudoku/solution_set/process/steps'
+require 'sudoku/solution_set/process/out_of_history'
+
+module Sudoku
+  class SolutionSet
+    class Process
+      STEPS = Hash[[
+        :pick_unsatisfied_constraint,
+        :pick_choice_satisfying_constraint,
+        :move_choice_into_included_set,
+        :delete_redundant_choices
+      ].collect { |name|
+        [
+          name,
+          Steps.const_get(
+            name.to_s.split('_').collect(&:capitalize).join
+          )
+        ]
+      }]
+
+      FALLBACKS = {
+        :pick_choice_satisfying_constraint => :pick_choice_satisfying_constraint
+      }
+
+      def initialize(solution_set)
+        @solution_set = solution_set
+        @queue, @history = [], []
+      end
+
+      def run!
+        loop do
+          if @queue.empty?
+            queue(STEPS.keys.first)
+          else
+            if proceed == :solved
+              prepare_next_run
+              return true
+            end
+          end
+        end
+      end
+
+      def queue(step, options={})
+        options = { :action => :take }.merge(options)
+
+        if step.is_a?(Symbol)
+          step = STEPS[step].new(@solution_set)
+        end
+
+        @queue << {
+          :action => options[:action],
+          :step   => step,
+          :input  => options[:input]
+        }
+      end
+
+      def queue_backtrack(step)
+        @history.reverse_each do |item|
+          queue(item[:step], :action => :revert)
+
+          if item[:step].class == STEPS[step]
+            queue(item[:step])
+            return
+          end
+        end
+
+        raise OutOfHistory, "unable to backtrack to #{step}"
+      end
+
+      def proceed
+        item = @queue.shift
+
+        case item[:action]
+        when :take
+          if output = item[:step].take(item[:input])
+            @history << item
+
+            if output == :solved
+              return :solved
+            end
+
+            queue(successor(item[:step]), :input => output)
+          else
+            queue_backtrack(fallback(item[:step]))
+          end
+        when :revert
+          item[:step].revert
+          @history.pop
+        end
+      end
+
+      def prepare_next_run
+        queue_backtrack(:pick_choice_satisfying_constraint)
+      end
+
+      def successor(step)
+        names = STEPS.keys
+        classes = STEPS.values
+
+        if step.class == classes.last
+          names.first
+        else
+          names[classes.index(step.class) + 1]
+        end
+      end
+
+      def fallback(step)
+        FALLBACKS[STEPS.invert[step.class]]
+      end
+    end
+  end
+end
+

data/lib/sudoku/solution_set.rb

@@ -0,0 +1,148 @@
+require 'sudoku/grid'
+require 'sudoku/solution_set/process'
+require 'sudoku/solution_set/constraints'
+require 'sudoku/solution_set/choice'
+
+module Sudoku
+  class SolutionSet
+    attr_reader :constraints, :included_choices
+
+    def initialize(puzzle)
+      @puzzle = Grid.new(puzzle)
+      @process = Process.new(self)
+
+      initialize_constraints
+      initialize_excluded_choices
+      initialize_included_choices
+      delete_redundant_choices
+    end
+
+    def each
+      loop do
+        if @process.run!
+          yield to_grid
+        else
+          return
+        end
+      end
+    end
+
+    def excluded_choices
+      @excluded_choices.sort_by! { |choice|
+        [choice.column, choice.row, choice.value]
+      }
+    end
+
+    def include_choice(choice)
+      @excluded_choices.delete(choice)
+      @included_choices << choice
+      choice
+    end
+
+    def exclude_choice(choice)
+      @included_choices.delete(choice)
+      @excluded_choices << choice
+      choice
+    end
+
+    def delete_excluded_choices_if
+      deleted_choices = []
+
+      @excluded_choices.delete_if do |excluded_choice|
+        if yield excluded_choice
+          deleted_choices << excluded_choice
+          true
+        end
+      end
+
+      deleted_choices
+    end
+
+    def restore_excluded_choices(choices)
+      choices.each do |choice|
+        @excluded_choices << choice
+      end
+    end
+
+    def to_grid
+      grid = Grid.new
+
+      @included_choices.each do |choice|
+        grid[choice.column, choice.row] = choice.value
+      end
+
+      grid
+    end
+
+    private
+
+    def initialize_constraints
+      @constraints = []
+
+      (1..9).each do |column|
+        (1..9).each do |row|
+          @constraints << Constraints::CellMustBeFilled.new(column, row)
+        end
+      end
+
+      (1..9).each do |column|
+        (1..9).each do |value|
+          @constraints << Constraints::ColumnMustContainValue.new(column, value)
+        end
+      end
+
+      (1..9).each do |row|
+        (1..9).each do |value|
+          @constraints << Constraints::RowMustContainValue.new(row, value)
+        end
+      end
+
+      (1..3).each do |box_x|
+        (1..3).each do |box_y|
+          (1..9).each do |value|
+            @constraints << Constraints::BoxMustContainValue.new(box_x, box_y, value)
+          end
+        end
+      end
+    end
+
+    def initialize_excluded_choices
+      @excluded_choices = []
+
+      (1..9).each do |column|
+        (1..9).each do |row|
+          (1..9).each do |value|
+            @excluded_choices << Choice.new(column, row, value)
+          end
+        end
+      end
+    end
+
+    def initialize_included_choices
+      @included_choices = []
+
+      @puzzle.filled_cells.each do |cell|
+        include_choice(@excluded_choices.find { |choice|
+          choice.column == cell.column &&
+            choice.row == cell.row &&
+            choice.value == cell.value
+        })
+      end
+    end
+
+    def delete_redundant_choices
+      satisfied_constraints = @constraints.select { |constraint|
+        @included_choices.any? { |excluded_choice|
+          constraint.satisfied_by?(excluded_choice)
+        }
+      }
+
+      @excluded_choices.delete_if do |excluded_choice|
+        satisfied_constraints.any? { |sc|
+          sc.satisfied_by?(excluded_choice)
+        }
+      end
+    end
+  end
+end
+

data/puzzles/blank.txt

@@ -0,0 +1,10 @@
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+

data/puzzles/easy.txt

@@ -0,0 +1,10 @@
+ 7 , 9 ,   ,   ,   ,   , 3 ,   ,  
+   ,   ,   ,   ,   , 6 , 9 ,   ,  
+ 8 ,   ,   ,   , 3 ,   ,   , 7 , 6
+   ,   ,   ,   ,   , 5 ,   ,   , 2
+   ,   , 5 , 4 , 1 , 8 , 7 ,   ,  
+ 4 ,   ,   , 7 ,   ,   ,   ,   ,  
+ 6 , 1 ,   ,   , 9 ,   ,   ,   , 8
+   ,   , 2 , 3 ,   ,   ,   ,   ,  
+   ,   , 9 ,   ,   ,   ,   , 5 , 4
+

data/puzzles/expert.txt

@@ -0,0 +1,10 @@
+   ,   , 6 ,   ,   ,   ,   ,   , 4
+   ,   ,   , 8 , 6 ,   , 7 , 3 ,  
+   , 4 ,   , 3 , 5 ,   ,   ,   , 2
+ 1 , 7 ,   , 4 ,   ,   , 6 ,   ,  
+   , 9 ,   ,   ,   ,   ,   , 8 ,  
+   ,   , 8 ,   ,   , 6 ,   , 1 , 7
+ 2 ,   ,   ,   , 8 , 1 ,   , 4 ,  
+   , 6 , 7 ,   , 4 , 3 ,   ,   ,  
+ 8 ,   ,   ,   ,   ,   , 3 ,   ,  
+

data/puzzles/extreme.txt

@@ -0,0 +1,10 @@
+   ,   , 9 , 7 , 4 , 8 ,   ,   ,  
+ 7 ,   ,   ,   ,   ,   ,   ,   ,  
+   , 2 ,   , 1 ,   , 9 ,   ,   ,  
+   ,   , 7 ,   ,   ,   , 2 , 4 ,  
+   , 6 , 4 ,   , 1 ,   , 5 , 9 ,  
+   , 9 , 8 ,   ,   ,   , 3 ,   ,  
+   ,   ,   , 8 ,   , 3 ,   , 2 ,  
+   ,   ,   ,   ,   ,   ,   ,   , 6
+   ,   ,   , 2 , 7 , 5 , 9 ,   ,  
+

data/puzzles/hard.txt

@@ -0,0 +1,10 @@
+   ,   ,   , 2 ,   ,   ,   , 6 , 3
+ 3 ,   ,   ,   ,   , 5 , 4 ,   , 1
+   ,   , 1 ,   ,   , 3 , 9 , 8 ,  
+   ,   ,   ,   ,   ,   ,   , 9 ,  
+   ,   ,   , 5 , 3 , 8 ,   ,   ,  
+   , 3 ,   ,   ,   ,   ,   ,   ,  
+   , 2 , 6 , 3 ,   ,   , 5 ,   ,  
+ 5 ,   , 3 , 7 ,   ,   ,   ,   , 8
+ 4 , 7 ,   ,   ,   , 1 ,   ,   ,  
+

data/puzzles/multiple-solutions.txt

@@ -0,0 +1,10 @@
+   , 9 ,   ,   ,   ,   , 3 ,   ,  
+   ,   ,   ,   ,   , 6 , 9 ,   ,  
+ 8 ,   ,   ,   , 3 ,   ,   , 7 , 6
+   ,   ,   ,   ,   , 5 ,   ,   , 2
+   ,   , 5 , 4 , 1 , 8 , 7 ,   ,  
+ 4 ,   ,   , 7 ,   ,   ,   ,   ,  
+ 6 , 1 ,   ,   , 9 ,   ,   ,   , 8
+   ,   , 2 , 3 ,   ,   ,   ,   ,  
+   ,   , 9 ,   ,   ,   ,   , 5 , 4
+

data/puzzles/standard.txt

@@ -0,0 +1,10 @@
+   ,   , 5 ,   , 9 ,   ,   ,   , 1
+   ,   ,   ,   ,   , 2 ,   , 7 , 3
+ 7 , 6 ,   ,   ,   , 8 , 2 ,   , 
+   , 1 , 2 ,   ,   , 9 ,   ,   , 4
+   ,   ,   , 2 ,   , 3 ,   ,   , 
+ 3 ,   ,   , 1 ,   ,   , 9 , 6 , 
+   ,   , 1 , 9 ,   ,   ,   , 5 , 8
+ 9 , 7 ,   , 5 ,   ,   ,   ,   , 
+ 5 ,   ,   ,   , 3 ,   , 7 ,   , 
+

data/puzzles/unsolvable.txt

@@ -0,0 +1,10 @@
+ 1 , 1 ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+   ,   ,   ,   ,   ,   ,   ,   ,  
+

metadata

@@ -0,0 +1,76 @@
+--- !ruby/object:Gem::Specification
+name: solve_sudoku
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- David Trasbo
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-03-21 00:00:00.000000000 Z
+dependencies: []
+description: ! 'Accepts a Sudoku puzzle (a partially completed grid) and outputs all
+  possible solutions. The algorithm is based on this article: http://garethrees.org/2007/06/10/zendoku-generation/'
+email: me@dtrasbo.com
+executables:
+- solve_sudoku
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE
+- README.md
+- bin/solve_sudoku
+- lib/solve_sudoku.rb
+- lib/sudoku/grid.rb
+- lib/sudoku/grid/cell.rb
+- lib/sudoku/solution_set.rb
+- lib/sudoku/solution_set/choice.rb
+- lib/sudoku/solution_set/constraints.rb
+- lib/sudoku/solution_set/constraints/box_must_contain_value.rb
+- lib/sudoku/solution_set/constraints/cell_must_be_filled.rb
+- lib/sudoku/solution_set/constraints/column_must_contain_value.rb
+- lib/sudoku/solution_set/constraints/row_must_contain_value.rb
+- lib/sudoku/solution_set/process.rb
+- lib/sudoku/solution_set/process/out_of_history.rb
+- lib/sudoku/solution_set/process/step.rb
+- lib/sudoku/solution_set/process/steps.rb
+- lib/sudoku/solution_set/process/steps/delete_redundant_choices.rb
+- lib/sudoku/solution_set/process/steps/move_choice_into_included_set.rb
+- lib/sudoku/solution_set/process/steps/pick_choice_satisfying_constraint.rb
+- lib/sudoku/solution_set/process/steps/pick_unsatisfied_constraint.rb
+- puzzles/blank.txt
+- puzzles/easy.txt
+- puzzles/expert.txt
+- puzzles/extreme.txt
+- puzzles/hard.txt
+- puzzles/multiple-solutions.txt
+- puzzles/standard.txt
+- puzzles/unsolvable.txt
+homepage: https://github.com/dtrasbo/solve_sudoku
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.16
+signing_key: 
+specification_version: 3
+summary: Accepts a Sudoku puzzle (a partially completed grid) and outputs all possible
+  solutions.
+test_files: []