sudokusolver_ng 2.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: bab3bb7004fd538bbae6ff152f7e63342bcc3de9
+  data.tar.gz: adfdadd1bf26701147c1b2d14b8d3629a63a6ee7
+SHA512:
+  metadata.gz: 2bb58f45c66d4808dcafb6ad17943e72ead7760125af3c69c5d6970689891b4dbb66a5f3f87cbe8334707ced4d390c1ae5351caa2d6ccd44618a0b3e34ca759b
+  data.tar.gz: 70d465640329480d528d31254908b7083db94fca96876330961b8bcf7a5b0223d9a981c7ee7b7f01e5940433c510f12fa91626f24658bb8275de80ffff6a25f3

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/.travis.yml

@@ -0,0 +1,13 @@
+language: ruby
+rvm:
+  - 2.2.0
+  - 2.1.0
+  - 2.0.0
+  - 1.9.3
+  - 1.8.7
+  - jruby-18mode
+  - jruby-19mode
+  - rbx-2
+  - ruby-head
+  - jruby-head
+  - ree

data/COPYING

@@ -0,0 +1 @@
+See the file called LICENSE

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in sudokusolver.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2007
+
+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,40 @@
+sudokusolver_ng
+============
+
+Commandline program and library for solving Sudoku puzzles
+
+[![Build Status](https://travis-ci.org/kaspergrubbe/sudokusolver_ng.svg?branch=master)](https://travis-ci.org/kaspergrubbe/sudokusolver_ng)
+
+## History
+
+This software was translated from the python source code obtained from Peter Norvig's website:
+
+http://www.norvig.com/sudoku.html
+http://www.norvig.com/sudo.py
+
+Thank you to Peter Norvig for the original python source code, algorithms and exceptionally clear explanations.
+
+All this work was done by Martin-Louis Bright, and then gemified and converted to Ruby 1.9 by Kasper Grubbe. The original project is called "sudokusolver" and is available from Rubygems here: https://rubygems.org/gems/sudokusolver, this is a fork moved to Github.
+
+## Install
+
+Add this to your `Gemfile`:
+
+```ruby
+gem 'sudokusolver_ng'
+```
+
+And remember to `bundle`
+
+## Usage
+
+```ruby
+require 'sudokusolver_ng'
+
+# The puzzle representation is simply the 9 rows of the Sudoku grid stringed together
+# from top to bottom (periods representing blank squares)
+
+puzzle = "4.....8.5.3..........7......2.....6.....8.4......1.......6.3.7.5..2.....1.4......"
+s = SudokuSolverNg.new
+s.print_grid(s.search(s.parse_grid(puzzle)))
+```

data/Rakefile

@@ -0,0 +1,6 @@
+require 'rake'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/lib/sudokusolver_ng.rb

@@ -0,0 +1,212 @@
+#!/usr/bin/env ruby
+#
+#  Translated into ruby from python by Martin-Louis Bright
+#  Algorithm, overall structure and original python source code by Peter Norvig
+#  See http://norvig.com/sudoku.html
+
+# Throughout this program:
+#   r is a row,    e.g. 'A'
+#   c is a column, e.g. '3'
+#   s is a square, e.g. 'A3'
+#   d is a digit,  e.g. '9'
+#   u is a unit,   e.g. ['A1','B1','C1','D1','E1','F1','G1','H1','I1']
+#   g is a grid,   e.g. 81 non-blank chars, e.g. starting with '.18...7...
+#   values is a hash of possible values, e.g. {'A1'=>'123489', 'A2'=>'8', ...}
+
+# Algorithm by Peter Norvig @ http://www.norvig.com/sudoku.html
+
+# More constraints:
+# http://www.scanraid.com/BasicStrategies.htm
+# http://www.krazydad.com/blog/2005/09/29/an-index-of-sudoku-strategies/
+# http://www2.warwick.ac.uk/fac/sci/moac/currentstudents/peter_cock/python/sudoku/
+
+class SudokuSolverNg
+  VERSION = "2.0.0"
+
+  attr_reader :rows, :cols, :squares, :unitlist, :peers, :units
+
+	# Cross-product
+  def cross(a, b)
+    cp = Array.new # cross product
+    a.each do |x|
+      b.each do |y|
+        cp << x+y
+      end
+    end
+    return cp
+  end
+
+  def initialize()
+    @rows = ('A'..'I').to_a
+    @cols = ('1'..'9').to_a
+    @squares = cross(@rows, @cols)
+    @unitlist = Array.new
+    cols.each { |c| @unitlist.push(cross(rows, [c])) }
+    rows.each { |r| @unitlist.push(cross([r], cols)) }
+    for rb in ['ABC','DEF','GHI'] do
+      for cb in ['123','456','789'] do
+        @unitlist << cross(rb.split(''),cb.split(''))
+      end
+    end
+
+    @units = Hash.new
+    squares.each do |s|
+      @units[s] = Array.new
+      unitlist.each do |u|
+        u.each do |x|
+          @units[s].push(u) if s == x
+        end
+      end
+    end
+
+    @peers = Hash.new
+    squares.each do |s|
+      @peers[s] = Array.new
+      units[s].each do |u|
+        u.each { |s2| @peers[s] << s2 if s2 != s }
+      end
+    end
+
+  end
+
+	# A grid is an 81 character string composed of the digits 0-9
+	# A blank is represented as a period.
+  def parse_grid(g)
+    g = g.chomp
+    g = g.split('')
+    values = Hash.new
+    # Initially any square can be anything.
+    squares.each { |s| values[s] = "123456789" }
+    for s,d in squares.zip(g)
+      return false unless assign(values, s, d) if d =~ /\d/
+    end
+    return values
+  end
+
+	# Assign a value to a square in the Sudoku grid:
+	# Eliminate all other possible digits from the square
+	# by calling the eliminate function (mutually recursive)
+  def assign(values, s, d)
+    values[s].split('').each do |d2|
+      unless d2 == d
+        return false if eliminate(values, s, d2) == false
+      end
+    end
+    return values
+  end
+
+	# Remove a possibility from a square.
+	# Recursively propagate the constraints: look at the source code for how this is done.
+  def eliminate(values, s, d)
+    return values unless values[s].include?(d) ## Already eliminated.
+
+    values[s] = values[s].sub(d,'') # Remove the digit from the string of possibilities
+    #  values[s].sub!(d,'') => why doesn't sub!() work?
+
+    return false if values[s].length == 0 # Contradiction: no more values (no more digits can be assigned)
+
+    # Remove digit from all peers
+		# If the square has only one remaining possibility, that is the assigned value for the square and
+		# that value must be removed from all that square's peers.
+    peers[s].each { |s2| return false unless eliminate(values, s2, values[s]) } if values[s].length == 1
+
+    # Assign the digit to the square if, by elimination
+		# this is the only square that has the digit as a possibility
+    units[s].each do |u|
+      dplaces = Array.new
+      u.each { |s2| dplaces << s2 if values[s2].include?(d) }
+      return false if dplaces.length == 0 # bad
+      return false if assign(values, dplaces[0], d) == false if dplaces.length == 1
+    end
+    return values
+  end
+
+	# Search if constraint satisfaction does not solve the puzzle
+  def search(values)
+    return false if values == false
+
+    solved = true # assumption
+    squares.each do |s|
+      unless values[s].length == 1
+        solved = false
+        break
+      end
+    end
+    return values if solved == true  ## Solved!
+
+    min = 10
+    start = nil
+    squares.each do |s| # Chose the undetermined square s with the fewest possibilities
+      l = values[s].length
+      if l > 1 && l < min
+        min = l
+        start = s
+      end
+    end
+
+    values[start].split('').each do |d|
+      solution = search(assign(values.clone,start,d))
+      return solution unless solution == false
+    end
+    return false
+  end
+
+	# Print a text Sudoku grid to STDOUT
+  def print_grid(values)
+    return if values == false
+    max = 0
+    squares.each { |s| max = values[s].length if values[s].length > max }
+    width = 1 + max
+    a = Array.new
+    3.times do |c|
+      tmp = ""
+      (3*width).times do
+        tmp = tmp + '-'
+      end
+      tmp += "-" if c == 1
+      a.push(tmp)
+    end
+    line  = "\n" + a.join('+')
+
+    tmp = ""
+    for r in rows
+      for c in cols
+        tmp = tmp + values[r+c].center(width)
+        if c == '3' or c == '6'
+          tmp = tmp + '| '
+        end
+      end
+      tmp = tmp + line if r == 'C' or r == 'F'
+      tmp = tmp + "\n"
+    end
+    puts tmp + "\n"
+    return values
+  end
+
+	# Transform the solution into an 81 character string
+  def string_solution(values)
+    solution = ""
+    squares.each do |s|
+      solution += values[s]
+    end
+    return solution
+  end
+
+	# Verify the Sudoku solution
+  def check_solution(solution)
+    values = Hash.new
+    for s,d in squares.zip(solution.split(''))
+      values[s] = d
+    end
+
+    unitlist.each do |u|
+      tmp = Hash.new
+      u.each do |s|
+        tmp[values[s]] = true
+      end
+      return false unless tmp.keys.length == 9
+    end
+    return true
+  end
+
+end

data/spec/boards/easy50.txt

@@ -0,0 +1,50 @@
+..3.2.6..9..3.5..1..18.64....81.29..7.......8..67.82....26.95..8..2.3..9..5.1.3..
+2...8.3...6..7..84.3.5..2.9...1.54.8.........4.27.6...3.1..7.4.72..4..6...4.1...3
+......9.7...42.18....7.5.261..9.4....5.....4....5.7..992.1.8....34.59...5.7......
+.3..5..4...8.1.5..46.....12.7.5.2.8....6.3....4.1.9.3.25.....98..1.2.6...8..6..2.
+.2.81.74.7....31...9...28.5..9.4..874..2.8..316..3.2..3.27...6...56....8.76.51.9.
+1..92....524.1...........7..5...81.2.........4.27...9..6...........3.945....71..6
+.43.8.25.6.............1.949....4.7....6.8....1.2....382.5.............5.34.9.71.
+48...69.2..2..8..19..37..6.84..1.2....37.41....1.6..49.2..85..77..9..6..6.92...18
+...9....2.5.1234...3....16.9.8.......7.....9.......2.5.91....5...7439.2.4....7...
+..19....39..7..16..3...5..7.5......9..43.26..2......7.6..1...3..42..7..65....68..
+...1254....84.....42.8......3.....95.6.9.2.1.51.....6......3.49.....72....1298...
+.6234.75.1....56..57.....4.....948..4.......6..583.....3.....91..64....7.59.8326.
+3..........5..9...2..5.4....2....7..16.....587.431.6.....89.1......67.8......5437
+63..........5....8..5674.......2......34.1.2.......345.....7..4.8.3..9.29471...8.
+....2..4...8.35.......7.6.2.31.4697.2...........5.12.3.49...73........1.8....4...
+361.259...8.96..1.4......57..8...471...6.3...259...8..74......5.2..18.6...547.329
+.5.8.7.2.6...1..9.7.254...6.7..2.3.15.4...9.81.3.8..7.9...762.5.6..9...3.8.1.3.4.
+.8...5........3457....7.8.9.6.4..9.3..7.1.5..4.8..7.2.9.1.2....8423........1...8.
+..35.29......4....1.6...3.59..251..8.7.4.8.3.8..763..13.8...1.4....2......51.48..
+...........98.51...519.742.29.4.1.65.........14.5.8.93.267.958...51.36...........
+.2..3..9....9.7...9..2.8..5..48.65..6.7...2.8..31.29..8..6.5..7...3.9....3..2..5.
+..5.....6.7...9.2....5..1.78.415.......8.3.......928.59.7..6....3.4...1.2.....6..
+.4.....5...19436....9...3..6...5...21.3...5.68...2...7..5...2....24367...3.....4.
+..4..........3...239.7...8.4....9..12.98.13.76..2....8.1...8.539...4..........8..
+36..2..89...361............8.3...6.24..6.3..76.7...1.8............418...97..3..14
+5..4...6...9...8..64..2.........1..82.8...5.17..5.........9..84..3...6...6...3..2
+..72564..4.......5.1..3..6....5.8.....8.6.2.....1.7....3..7..9.2.......4..63127..
+..........79.5.18.8.......7..73.68..45.7.8.96..35.27..7.......5.16.3.42..........
+.3.....8...9...5....75.92..7..1.5..8.2..9..3.9..4.2..1..42.71....2...8...7.....9.
+2..17.6.3.5....1.......6.79....4.7.....8.1.....9.5....31.4.......5....6.9.6.37..2
+.......8.8..7.1.4..4..2..3.374...9......3......5...321.1..6..5..5.8.2..6.8.......
+.......85...21...996..8.1..5..8...16.........89...6..7..9.7..523...54...48.......
+6.8.7.5.2.5.6.8.7...2...3..5...9...6.4.3.2.5.8...5...3..5...2...1.7.4.9.4.9.6.7.1
+.5..1..4.1.7...6.2...9.5...2.8.3.5.1.4..7..2.9.1.8.4.6...4.1...3.4...7.9.2..6..1.
+.53...79...97534..1.......2.9..8..1....9.7....8..3..7.5.......3..76412...61...94.
+..6.8.3...49.7.25....4.5...6..317..4..7...8..1..826..9...7.2....75.4.19...3.9.6..
+..5.8.7..7..2.4..532.....84.6.1.5.4...8...5...7.8.3.1.45.....916..5.8..7..3.1.6..
+...9..8..128..64...7.8...6.8..43...75.......96...79..8.9...4.1...36..284..1..7...
+....8....27.....54.95...81...98.64...2.4.3.6...69.51...17...62.46.....38....9....
+...6.2...4...5...1.85.1.62..382.671...........194.735..26.4.53.9...2...7...8.9...
+...9....2.5.1234...3....16.9.8.......7.....9.......2.5.91....5...7439.2.4....7...
+38..........4..785..9.2.3...6..9....8..3.2..9....4..7...1.7.5..495..6..........92
+...158.....2.6.8...3.....4..27.3.51...........46.8.79..5.....8...4.7.1.....325...
+.1.5..2..9....1.....2..8.3.5...3...7..8...5..6...8...4.4.1..7.....7....6..3..4.5.
+.8.....4....469...4.......7..59.46...7.6.8.3...85.21..9.......5...781....6.....1.
+9.42....7.1..........7.65.....8...9..2.9.4.6..4...2.....16.7..........3.3....57.2
+...7..8....6....31.4...2....24.7.....1..3..8.....6.29....8...7.86....5....2..6...
+..1..7.9.59..8...1.3.....8......58...5..6..2...41......8.....3.1...2..79.2.7..4..
+.....3.17.15..9..8.6.......1....7.....9...2.....5....4.......2.5..6..34.34.2.....
+3..2........1.7...7.6.3.5...7...9.8.9...2...4.1.8...5...9.4.3.1...7.2........8..6

data/spec/boards/hardest.txt

@@ -0,0 +1,11 @@
+85...24..72......9..4.........1.7..23.5...9...4...........8..7..17..........36.4.
+..53.....8......2..7..1.5..4....53...1..7...6..32...8..6.5....9..4....3......97..
+12..4......5.69.1...9...5.........7.7...52.9..3......2.9.6...5.4..9..8.1..3...9.4
+...57..3.1......2.7...234......8...4..7..4...49....6.5.42...3.....7..9....18.....
+7..1523........92....3.....1....47.8.......6............9...5.6.4.9.7...8....6.1.
+1....7.9..3..2...8..96..5....53..9...1..8...26....4...3......1..4......7..7...3..
+1...34.8....8..5....4.6..21.18......3..1.2..6......81.52..7.9....6..9....9.64...2
+...92......68.3...19..7...623..4.1....1...7....8.3..297...8..91...5.72......64...
+.6.5.4.3.1...9...8.........9...5...6.4.6.2.7.7...4...5.........4...8...1.5.2.3.4.
+7.....4...2..7..8...3..8.799..5..3...6..2..9...1.97..6...3..9...3..4..6...9..1.35
+....7..2.8.......6.1.2.5...9.54....8.........3....85.1...3.2.8.4.......9.7..6....

data/spec/boards/top95.txt

@@ -0,0 +1,95 @@
+4.....8.5.3..........7......2.....6.....8.4......1.......6.3.7.5..2.....1.4......
+52...6.........7.13...........4..8..6......5...........418.........3..2...87.....
+6.....8.3.4.7.................5.4.7.3..2.....1.6.......2.....5.....8.6......1....
+48.3............71.2.......7.5....6....2..8.............1.76...3.....4......5....
+....14....3....2...7..........9...3.6.1.............8.2.....1.4....5.6.....7.8...
+......52..8.4......3...9...5.1...6..2..7........3.....6...1..........7.4.......3.
+6.2.5.........3.4..........43...8....1....2........7..5..27...........81...6.....
+.524.........7.1..............8.2...3.....6...9.5.....1.6.3...........897........
+6.2.5.........4.3..........43...8....1....2........7..5..27...........81...6.....
+.923.........8.1...........1.7.4...........658.........6.5.2...4.....7.....9.....
+6..3.2....5.....1..........7.26............543.........8.15........4.2........7..
+.6.5.1.9.1...9..539....7....4.8...7.......5.8.817.5.3.....5.2............76..8...
+..5...987.4..5...1..7......2...48....9.1.....6..2.....3..6..2.......9.7.......5..
+3.6.7...........518.........1.4.5...7.....6.....2......2.....4.....8.3.....5.....
+1.....3.8.7.4..............2.3.1...........958.........5.6...7.....8.2...4.......
+6..3.2....4.....1..........7.26............543.........8.15........4.2........7..
+....3..9....2....1.5.9..............1.2.8.4.6.8.5...2..75......4.1..6..3.....4.6.
+45.....3....8.1....9...........5..9.2..7.....8.........1..4..........7.2...6..8..
+.237....68...6.59.9.....7......4.97.3.7.96..2.........5..47.........2....8.......
+..84...3....3.....9....157479...8........7..514.....2...9.6...2.5....4......9..56
+.98.1....2......6.............3.2.5..84.........6.........4.8.93..5...........1..
+..247..58..............1.4.....2...9528.9.4....9...1.........3.3....75..685..2...
+4.....8.5.3..........7......2.....6.....5.4......1.......6.3.7.5..2.....1.9......
+.2.3......63.....58.......15....9.3....7........1....8.879..26......6.7...6..7..4
+1.....7.9.4...72..8.........7..1..6.3.......5.6..4..2.........8..53...7.7.2....46
+4.....3.....8.2......7........1...8734.......6........5...6........1.4...82......
+.......71.2.8........4.3...7...6..5....2..3..9........6...7.....8....4......5....
+6..3.2....4.....8..........7.26............543.........8.15........8.2........7..
+.47.8...1............6..7..6....357......5....1..6....28..4.....9.1...4.....2.69.
+......8.17..2........5.6......7...5..1....3...8.......5......2..4..8....6...3....
+38.6.......9.......2..3.51......5....3..1..6....4......17.5..8.......9.......7.32
+...5...........5.697.....2...48.2...25.1...3..8..3.........4.7..13.5..9..2...31..
+.2.......3.5.62..9.68...3...5..........64.8.2..47..9....3.....1.....6...17.43....
+.8..4....3......1........2...5...4.69..1..8..2...........3.9....6....5.....2.....
+..8.9.1...6.5...2......6....3.1.7.5.........9..4...3...5....2...7...3.8.2..7....4
+4.....5.8.3..........7......2.....6.....5.8......1.......6.3.7.5..2.....1.8......
+1.....3.8.6.4..............2.3.1...........958.........5.6...7.....8.2...4.......
+1....6.8..64..........4...7....9.6...7.4..5..5...7.1...5....32.3....8...4........
+249.6...3.3....2..8.......5.....6......2......1..4.82..9.5..7....4.....1.7...3...
+...8....9.873...4.6..7.......85..97...........43..75.......3....3...145.4....2..1
+...5.1....9....8...6.......4.1..........7..9........3.8.....1.5...2..4.....36....
+......8.16..2........7.5......6...2..1....3...8.......2......7..3..8....5...4....
+.476...5.8.3.....2.....9......8.5..6...1.....6.24......78...51...6....4..9...4..7
+.....7.95.....1...86..2.....2..73..85......6...3..49..3.5...41724................
+.4.5.....8...9..3..76.2.....146..........9..7.....36....1..4.5..6......3..71..2..
+.834.........7..5...........4.1.8..........27...3.....2.6.5....5.....8........1..
+..9.....3.....9...7.....5.6..65..4.....3......28......3..75.6..6...........12.3.8
+.26.39......6....19.....7.......4..9.5....2....85.....3..2..9..4....762.........4
+2.3.8....8..7...........1...6.5.7...4......3....1............82.5....6...1.......
+6..3.2....1.....5..........7.26............843.........8.15........8.2........7..
+1.....9...64..1.7..7..4.......3.....3.89..5....7....2.....6.7.9.....4.1....129.3.
+.........9......84.623...5....6...453...1...6...9...7....1.....4.5..2....3.8....9
+.2....5938..5..46.94..6...8..2.3.....6..8.73.7..2.........4.38..7....6..........5
+9.4..5...25.6..1..31......8.7...9...4..26......147....7.......2...3..8.6.4.....9.
+...52.....9...3..4......7...1.....4..8..453..6...1...87.2........8....32.4..8..1.
+53..2.9...24.3..5...9..........1.827...7.........981.............64....91.2.5.43.
+1....786...7..8.1.8..2....9........24...1......9..5...6.8..........5.9.......93.4
+....5...11......7..6.....8......4.....9.1.3.....596.2..8..62..7..7......3.5.7.2..
+.47.2....8....1....3....9.2.....5...6..81..5.....4.....7....3.4...9...1.4..27.8..
+......94.....9...53....5.7..8.4..1..463...........7.8.8..7.....7......28.5.26....
+.2......6....41.....78....1......7....37.....6..412....1..74..5..8.5..7......39..
+1.....3.8.6.4..............2.3.1...........758.........7.5...6.....8.2...4.......
+2....1.9..1..3.7..9..8...2.......85..6.4.........7...3.2.3...6....5.....1.9...2.5
+..7..8.....6.2.3...3......9.1..5..6.....1.....7.9....2........4.83..4...26....51.
+...36....85.......9.4..8........68.........17..9..45...1.5...6.4....9..2.....3...
+34.6.......7.......2..8.57......5....7..1..2....4......36.2..1.......9.......7.82
+......4.18..2........6.7......8...6..4....3...1.......6......2..5..1....7...3....
+.4..5..67...1...4....2.....1..8..3........2...6...........4..5.3.....8..2........
+.......4...2..4..1.7..5..9...3..7....4..6....6..1..8...2....1..85.9...6.....8...3
+8..7....4.5....6............3.97...8....43..5....2.9....6......2...6...7.71..83.2
+.8...4.5....7..3............1..85...6.....2......4....3.26............417........
+....7..8...6...5...2...3.61.1...7..2..8..534.2..9.......2......58...6.3.4...1....
+......8.16..2........7.5......6...2..1....3...8.......2......7..4..8....5...3....
+.2..........6....3.74.8.........3..2.8..4..1.6..5.........1.78.5....9..........4.
+.52..68.......7.2.......6....48..9..2..41......1.....8..61..38.....9...63..6..1.9
+....1.78.5....9..........4..2..........6....3.74.8.........3..2.8..4..1.6..5.....
+1.......3.6.3..7...7...5..121.7...9...7........8.1..2....8.64....9.2..6....4.....
+4...7.1....19.46.5.....1......7....2..2.3....847..6....14...8.6.2....3..6...9....
+......8.17..2........5.6......7...5..1....3...8.......5......2..3..8....6...4....
+963......1....8......2.5....4.8......1....7......3..257......3...9.2.4.7......9..
+15.3......7..4.2....4.72.....8.........9..1.8.1..8.79......38...........6....7423
+..........5724...98....947...9..3...5..9..12...3.1.9...6....25....56.....7......6
+....75....1..2.....4...3...5.....3.2...8...1.......6.....1..48.2........7........
+6.....7.3.4.8.................5.4.8.7..2.....1.3.......2.....5.....7.9......1....
+....6...4..6.3....1..4..5.77.....8.5...8.....6.8....9...2.9....4....32....97..1..
+.32.....58..3.....9.428...1...4...39...6...5.....1.....2...67.8.....4....95....6.
+...5.3.......6.7..5.8....1636..2.......4.1.......3...567....2.8..4.7.......2..5..
+.5.3.7.4.1.........3.......5.8.3.61....8..5.9.6..1........4...6...6927....2...9..
+..5..8..18......9.......78....4.....64....9......53..2.6.........138..5....9.714.
+..........72.6.1....51...82.8...13..4.........37.9..1.....238..5.4..9.........79.
+...658.....4......12............96.7...3..5....2.8...3..19..8..3.6.....4....473..
+.2.3.......6..8.9.83.5........2...8.7.9..5........6..4.......1...1...4.22..7..8.9
+.5..9....1.....6.....3.8.....8.4...9514.......3....2..........4.8...6..77..15..6.
+.....2.......7...17..3...9.8..7......2.89.6...13..6....9..5.824.....891..........
+3...8.......7....51..............36...2..4....7...........6.13..452...........8..

data/spec/spec_helper.rb

@@ -0,0 +1,85 @@
+# This file was generated by the `rspec --init` command. Conventionally, all
+# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
+# The generated `.rspec` file contains `--require spec_helper` which will cause this
+# file to always be loaded, without a need to explicitly require it in any files.
+#
+# Given that it is always loaded, you are encouraged to keep this file as
+# light-weight as possible. Requiring heavyweight dependencies from this file
+# will add to the boot time of your test suite on EVERY test run, even for an
+# individual file that may not need all of that loaded. Instead, consider making
+# a separate helper file that requires the additional dependencies and performs
+# the additional setup, and require it from the spec files that actually need it.
+#
+# The `.rspec` file also contains a few flags that are not defaults but that
+# users commonly want.
+#
+# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
+RSpec.configure do |config|
+  # rspec-expectations config goes here. You can use an alternate
+  # assertion/expectation library such as wrong or the stdlib/minitest
+  # assertions if you prefer.
+  config.expect_with :rspec do |expectations|
+    # This option will default to `true` in RSpec 4. It makes the `description`
+    # and `failure_message` of custom matchers include text for helper methods
+    # defined using `chain`, e.g.:
+    # be_bigger_than(2).and_smaller_than(4).description
+    #   # => "be bigger than 2 and smaller than 4"
+    # ...rather than:
+    #   # => "be bigger than 2"
+    expectations.include_chain_clauses_in_custom_matcher_descriptions = true
+  end
+
+  # rspec-mocks config goes here. You can use an alternate test double
+  # library (such as bogus or mocha) by changing the `mock_with` option here.
+  config.mock_with :rspec do |mocks|
+    # Prevents you from mocking or stubbing a method that does not exist on
+    # a real object. This is generally recommended, and will default to
+    # `true` in RSpec 4.
+    mocks.verify_partial_doubles = true
+  end
+
+  # These two settings work together to allow you to limit a spec run
+  # to individual examples or groups you care about by tagging them with
+  # `:focus` metadata. When nothing is tagged with `:focus`, all examples
+  # get run.
+  config.filter_run :focus
+  config.run_all_when_everything_filtered = true
+
+  # Limits the available syntax to the non-monkey patched syntax that is recommended.
+  # For more details, see:
+  #   - http://myronmars.to/n/dev-blog/2012/06/rspecs-new-expectation-syntax
+  #   - http://teaisaweso.me/blog/2013/05/27/rspecs-new-message-expectation-syntax/
+  #   - http://myronmars.to/n/dev-blog/2014/05/notable-changes-in-rspec-3#new__config_option_to_disable_rspeccore_monkey_patching
+  config.disable_monkey_patching!
+
+  # This setting enables warnings. It's recommended, but in some cases may
+  # be too noisy due to issues in dependencies.
+  config.warnings = true
+
+  # Many RSpec users commonly either run the entire suite or an individual
+  # file, and it's useful to allow more verbose output when running an
+  # individual spec file.
+  if config.files_to_run.one?
+    # Use the documentation formatter for detailed output,
+    # unless a formatter has already been configured
+    # (e.g. via a command-line flag).
+    config.default_formatter = 'doc'
+  end
+
+  # Print the 10 slowest examples and example groups at the
+  # end of the spec run, to help surface which specs are running
+  # particularly slow.
+  config.profile_examples = 10
+
+  # Run specs in random order to surface order dependencies. If you find an
+  # order dependency and want to debug it, you can fix the order by providing
+  # the seed, which is printed after each run.
+  #     --seed 1234
+  config.order = :random
+
+  # Seed global randomization in this process using the `--seed` CLI option.
+  # Setting this allows you to use `--seed` to deterministically reproduce
+  # test failures related to randomization by passing the same `--seed` value
+  # as the one that triggered the failure.
+  Kernel.srand config.seed
+end

data/spec/sudoku_spec.rb

@@ -0,0 +1,51 @@
+require 'sudokusolver_ng'
+
+RSpec.describe 'Driver spec' do
+  before(:all) do
+    @solver = SudokuSolverNg.new
+
+    @easy  = File.read(File.expand_path("spec/boards/easy50.txt")).split("\n")
+    @top95 = File.read(File.expand_path("spec/boards/top95.txt")).split("\n")
+    @hard  = File.read(File.expand_path("spec/boards/hardest.txt")).split("\n")
+  end
+
+  def multiple(puzzles)
+    puzzles.map{|puzzle| @solver.check_solution(@solver.string_solution(@solver.search(@solver.parse_grid(puzzle)))) }
+  end
+
+  it 'should give the developers of this gem the idea that it solves properly' do
+    puts "Easy puzzle (constraint satisfaction only): "
+    puts
+    @solver.print_grid(@solver.search(@solver.parse_grid(@easy.first)))
+    puts "Hard puzzle (constraint satisfaction + search): "
+    puts
+    @solver.print_grid(@solver.search(@solver.parse_grid(@hard.first)))
+  end
+
+  it 'should solve the board' do
+    puzzle   = '4.....8.5.3..........7......2.....6.....8.4......1.......6.3.7.5..2.....1.4......'
+    solution = @solver.string_solution(@solver.search(@solver.parse_grid(puzzle)))
+
+    expect(@solver.check_solution(solution)).to be true
+  end
+
+  it 'run with an empty puzzle' do
+    puzzle = '.................................................................................'
+    solution = @solver.string_solution(@solver.search(@solver.parse_grid(puzzle)))
+
+    expect(@solver.check_solution(solution)).to be true
+  end
+
+  it 'should solve all easy boards' do
+    expect( multiple(@easy).all?{|solved| solved == true} ).to be true
+  end
+
+  it 'should solve all top95 boards' do
+    expect( multiple(@top95).all?{|solved| solved == true} ).to be true
+  end
+
+  it 'should solve all hard boards' do
+    expect( multiple(@hard).all?{|solved| solved == true} ).to be true
+  end
+
+end

data/sudokusolver_ng.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'sudokusolver_ng'
+
+Gem::Specification.new do |spec|
+  spec.name          = "sudokusolver_ng"
+  spec.version       = SudokuSolverNg::VERSION
+  spec.authors       = ["Martin-Louis Bright", "Kasper Grubbe"]
+  spec.email         = ["mlbright@gmail.com", "kaspergrubbe@gmail.com"]
+  spec.summary       = %q{Commandline program and library for solving Sudoku puzzles}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.6"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.1"
+end

metadata

@@ -0,0 +1,108 @@
+--- !ruby/object:Gem::Specification
+name: sudokusolver_ng
+version: !ruby/object:Gem::Version
+  version: 2.0.0
+platform: ruby
+authors:
+- Martin-Louis Bright
+- Kasper Grubbe
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2016-01-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+description: 
+email:
+- mlbright@gmail.com
+- kaspergrubbe@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- COPYING
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- lib/sudokusolver_ng.rb
+- spec/boards/easy50.txt
+- spec/boards/hardest.txt
+- spec/boards/top95.txt
+- spec/spec_helper.rb
+- spec/sudoku_spec.rb
+- sudokusolver_ng.gemspec
+homepage: ''
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.8
+signing_key: 
+specification_version: 4
+summary: Commandline program and library for solving Sudoku puzzles
+test_files:
+- spec/boards/easy50.txt
+- spec/boards/hardest.txt
+- spec/boards/top95.txt
+- spec/spec_helper.rb
+- spec/sudoku_spec.rb