sudoku-jedi 1.0.0 → 1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 715508f1c610092734bdf40ae65db9024929c0ff
-  data.tar.gz: 9931aab8641b370f75f7953b9edfdbf6de5407b5
+  metadata.gz: f4a65264e38d3e9e78a2e0cbdf9e433e91efcb25
+  data.tar.gz: 3aed78fd176a87dab990ea30b04e1b0f51392c7f
 SHA512:
-  metadata.gz: e915a77d5f995f351b277794d81b49bb181a1eef971b7ea6887c2c71f8a0447341a52289c991b0f3625414f61cd68c6f8bd46503148e3ea8d1552ab45541ecf4
-  data.tar.gz: 385477d7091398a3a9755d77ee87f8fbfd17e630733e27ea24460a9de1b6a2a20d3046113a9fb7b9e2ce9b05d675f7beca9906a6adeca4ecfbdd1e618858ad2d
+  metadata.gz: 1b138a51927e75eb17fd5091635c705f6e65e7dd89a974295400836e9772a021af6d25981480b9dabba4cf273049c19dc3e89f28ca19dc1e9555a29ca40757f1
+  data.tar.gz: fb7154e8cf0595d188695d97b9319889a638c92feed36fa4dd6691243a3f60da2246a82f3b24126d2c5a1d3ecd1860942d905f83f69205b395d4ff65c00ff578

data/README.md

@@ -4,6 +4,8 @@
 [![Gem Version](https://badge.fury.io/rb/sudoku-jedi.svg)](http://badge.fury.io/rb/sudoku-jedi)
 
 Currently solves easy to moderate sudoku puzzles in a flash!
+This sudoku solver implementation uses solution tactics such as naked pairs, hidden pairs, box/line reduction, and X-wing strategies for tougher puzzles.
+You can read about these techniques [here](http://www.sudokuwiki.org/sudoku.htm)
 
 ## Installation
 
@@ -19,7 +21,7 @@ And then execute:
 
 Or install it yourself as:
 
-    $ gem install sudoku_solver
+    $ gem install sudoku-jedi
 
 ## Usage
 

data/lib/sudoku_solver.rb

@@ -1,8 +1,4 @@
 require "sudoku_solver/version"
-require "sudoku_solver/cell"
-require "sudoku_solver/box"
-require 'sudoku_solver/row'
-require 'sudoku_solver/column'
 require 'sudoku_solver/grid'
 require 'sudoku_solver/cli'
 module SudokuSolver

data/lib/sudoku_solver/grid.rb

@@ -1,4 +1,3 @@
-require_relative 'box'
 require_relative 'point'
 require 'set'
 
@@ -12,7 +11,7 @@ class Grid
       end
     end
     
-    @points.select { |po| po.value == 0 }.each do |poi|
+    remaining_points.each do |poi|
       poi.nums = Array(1..9) - (get_box(poi.box) + get_row(poi.y) + get_column(poi.x))
     end
   end
@@ -191,8 +190,6 @@ class Grid
 
   def hidden_pairs
     all_naked_pairs
-#   @points.select { |p| p.x == 6  &&  p.y == 4  }.first.nums =  @points.select { |p| p.x == 6  &&  p.y == 4  }.first.nums - [1,5]
-#   @points.select { |p| p.x == 6  &&  p.y == 6  }.first.nums =  @points.select { |p| p.x == 6  &&  p.y == 6  }.first.nums - [3,6]
     
     remaining_points.each do |point|
       next if point.nums.count <= 1
@@ -219,12 +216,17 @@ class Grid
         [:x, :y].each do |symbol|
           arr = @points.select{ |p| p.nums.include?(num) && p.send(flip(symbol)) == point.send(flip(symbol)) && p.value == 0  }
           if arr.count == 2 && @points.select { |p| p.value == num && p.send(flip(symbol)) == point.send(flip(symbol)) }.count == 0
-            last = @points.select { |p| p.nums.include?(num) && arr.map{ |a| a.send(symbol) }.include?(p.send(symbol)) && (!arr.include?(p)) && p.value == 0 && check_row(p.y,p,num,symbol) }
-            if last.all? { |x| x.send(flip(symbol)) == last.first.send(flip(symbol)) } && last.count == 2 && @points.select { |p| p.value == num && p.send(flip(symbol)) == last.first.send(flip(symbol)) }.count == 0
-              final = arr + last 
-              places = final.map { |m| m.send(symbol) }.uniq
-              remaining_points.select { |p| places.include?(p.send(symbol)) && (!final.include?(p)) }.each do |poi|
-                poi.nums = poi.nums - [num]
+            last = @points.select { |p| p.nums.include?(num) &&
+                                    arr.map{ |a| a.send(symbol) }.include?(p.send(symbol)) &&
+                                    (!arr.include?(p)) &&
+                                    p.value == 0 && check_row(p.y,p,num,symbol) }
+            if last.all? { |x| x.send(flip(symbol)) == last.first.send(flip(symbol)) } &&
+               last.count == 2 && 
+               @points.select { |p| p.value == num && p.send(flip(symbol)) == last.first.send(flip(symbol)) }.count == 0
+                 final = arr + last 
+                 places = final.map { |m| m.send(symbol) }.uniq
+                 remaining_points.select { |p| places.include?(p.send(symbol)) && (!final.include?(p)) }.each do |poi|
+                 poi.nums = poi.nums - [num]
               end
             end
           end

data/lib/sudoku_solver/point.rb

@@ -1,4 +1,3 @@
-require_relative 'container'
 require 'set'
 
 class Point
@@ -16,7 +15,6 @@ class Point
     @nums.sort
   end
 
-
   def share(point)
     a = []
     a << :box if @box == point.box
@@ -62,10 +60,5 @@ class Point
     @position.y
   end
     
-  def blank_spaces
-    [(position.y / 3) * 3 + (position.x / 3), position.y, position.x]
-  end
-
-
 end
 

data/lib/sudoku_solver/version.rb

@@ -1,3 +1,3 @@
 module SudokuSolver
-  VERSION = "1.0.0"
+  VERSION = "1.0.1"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: sudoku-jedi
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.1
 platform: ruby
 authors:
 - ajn123
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-01-18 00:00:00.000000000 Z
+date: 2015-01-19 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -183,17 +183,10 @@ files:
 - Rakefile
 - bin/sudoku-jedi
 - lib/sudoku_solver.rb
-- lib/sudoku_solver/box.rb
-- lib/sudoku_solver/cell.rb
 - lib/sudoku_solver/cli.rb
-- lib/sudoku_solver/column.rb
-- lib/sudoku_solver/container.rb
 - lib/sudoku_solver/grid.rb
 - lib/sudoku_solver/point.rb
-- lib/sudoku_solver/row.rb
 - lib/sudoku_solver/version.rb
-- spec/box_spec.rb
-- spec/cell_spec.rb
 - spec/grid_spec.rb
 - spec/spec_helper.rb
 - sudoku_solver.gemspec
@@ -222,7 +215,5 @@ signing_key:
 specification_version: 4
 summary: Solves a sudoku puzzle
 test_files:
-- spec/box_spec.rb
-- spec/cell_spec.rb
 - spec/grid_spec.rb
 - spec/spec_helper.rb

data/lib/sudoku_solver/box.rb

@@ -1,16 +0,0 @@
-require_relative 'container'
-
-class Box < Container 
-  attr_accessor :box, :position
-
-  def initialize(arr, y=0, x=0)
-    super(arr)
-    Struct.new("Coordinate", :x, :y) if !Struct::const_defined? "Coordinate"
-    @position = Struct::Coordinate.new(x, y)
-  end
-    
-  def blank_spaces
-    [(position.y / 3) * 3 + (position.x / 3), position.y, position.x]
-  end
-
-end

data/lib/sudoku_solver/cell.rb

@@ -1,6 +0,0 @@
-class Cell
-  attr_accessor :num
-  def initialize(num)
-    @num = num
-  end
-end

data/lib/sudoku_solver/column.rb

@@ -1,6 +0,0 @@
-require_relative 'container'
-class Column < Container 
-
-
-
-end

data/lib/sudoku_solver/container.rb

@@ -1,35 +0,0 @@
-class Container
-  
-  attr_accessor :arr, :remaining_blocks  
-  def initialize(arr)
-    @arr = arr
-  end
-  # Find the missing elements in the section
-  def difference 
-    complete 
-    remaining 
-  end
-
-  def remaining
-    Array(1..9) - arr
-  end
-
-  def arr
-    @arr.map!(&:to_i)
-  end
-
-  def contain?(num)
-    complete 
-    arr.include? num
-  end
-
-  def pencil_in
-  end
-
-
-  def complete 
-    if remaining.count == 1
-      arr.map { |elem| elem == 0 ? remaining.first : elem }
-    end
-  end
-end

data/lib/sudoku_solver/row.rb

@@ -1,4 +0,0 @@
-require_relative 'container'
-class Row < Container
-  
-end

data/spec/box_spec.rb

@@ -1,25 +0,0 @@
-require 'spec_helper'
-describe Box do 
-  let(:box) { Box.new([1,2,4,5,6,7,8,9], 0, 5)}
-  context "Coordinates" do 
-    it "is correct" do 
-      expect(box.blank_spaces).to eql([1, 0, 5])
-      @let_box = Box.new([], 8, 8)
-      expect(@let_box.blank_spaces).to eql([8, 8, 8])
-    end
-  end
-  context "#differance" do
-    it "shows the incorrect differance" do
-      expect(box.difference).to_not eql(Array(5..9))
-    end
-    it "show the correct differance" do 
-      expect(box.difference).to eql([3])
-    end
-  end 
-  context "#complete" do 
-    it "completes the cell" do 
-      @in_box = Box.new([1,0,3,4,5,6,7,8,9])
-      expect(@in_box.complete).to eql(Array(1..9))
-    end
-  end
-end

data/spec/cell_spec.rb

@@ -1,8 +0,0 @@
-require 'spec_helper'
-describe Cell do
-  let(:cell) { Cell.new(234) }
-  it "#num" do
-    expect(cell.num).to eql(234)
-  end
-  
-end