nsudoku 0.1.0

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/.rvmrc

@@ -0,0 +1,6 @@
+# create the gemset if it does not exist
+rvm_gemset_create_on_use_flag=1
+# switch to default ruby version when exiting directory
+rvm_project_rvmrc_default=1
+# use ruby 1.8.7 with a specific gemset
+rvm ruby-1.9.3-p194@sudoku2

data/Gemfile

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

data/LICENSE

@@ -0,0 +1,22 @@
+Copyright (c) 2012 Michał Szyma
+
+MIT License
+
+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,34 @@
+# Sudoku
+
+This gem solve puzzle game sudoku 9x9
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    > gem 'nsudoku'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install nsudoku
+
+## Usage
+
+    > require 'nsudoku'
+    > EXAMPLE = [
+    >   "012000000",
+    >   "304052000",
+    >   "605170000",
+    >   "070208090",
+    >   "920700084",
+    >   "050906010",
+    >   "000320908",
+    >   "000580107",
+    >   "000000240"].join
+
+    > NSudoku.new(EXAMPLE) #=> "712460850394852671685170420070208596926715384050906712540320968269584137030690245"
+

data/Rakefile

@@ -0,0 +1,2 @@
+#!/usr/bin/env rake
+require "bundler/gem_tasks"

data/lib/nsudoku/version.rb

@@ -0,0 +1,3 @@
+class NSudoku
+  VERSION = "0.1.0"
+end

data/lib/nsudoku.rb

@@ -0,0 +1,193 @@
+require "nsudoku/version"
+
+class NSudoku
+
+  def initialize(data)
+    @revers_table = create_revers_table(data.split(""))
+  end
+
+  def solve
+    revers_table = nil
+    while not revers_table == @revers_table
+      revers_table = Marshal.load(Marshal.dump(@revers_table))
+
+     9.times do |index|
+        cells_with_two_elements_for('row', index)
+        cells_with_two_elements_for('column', index)
+        cells_with_two_elements_for('block', index)
+        erase_in_horizontal_three(index)
+        erase_in_vertical_three(index)
+     end
+
+      9.times do |row_index|
+        9.times do |column_index|
+          erase_in_vertical_one(row_index, column_index)
+          erase_in_horizontal_one(row_index, column_index)
+          erase_in_block_one(row_index, column_index)
+        end
+      end
+    end
+    revers_table_to_result
+  end
+
+  def show_table_pretty
+     @revers_table.each do |cell|
+       puts cell.inspect
+     end
+  end
+private
+
+  # table = [[[1, 2, 3, 4, 5], [], ..., []],
+  #          [[],                  ..., []],
+  #                    ...
+  #          [[],                  ..., []]
+  #         ]
+  def create_revers_table(data)
+    result = 9.times.map{|row_element| 9.times.map{|col_element| []}}
+    data.each_with_index do |cell, index|
+      column = index % 9
+      row = (index - column)/9 % 9
+      cell = cell.to_i
+      result[row][column] = [cell]
+      result[row][column] = 9.times.map{|element| element + 1} if cell == 0
+    end
+    return result
+  end
+
+  # revers table @revers_table into string where cell [n] return n and [a1, a2, ..., ak] return 0
+  def revers_table_to_result
+    result = ""
+    @revers_table.flatten(1).each do |element|
+      result << (element.size == 1 ? element.first.to_s : "0")
+    end
+    result
+  end
+
+
+  def positions_for(type, index0, index1)
+    case type
+    when 'column'
+      return {
+        row: index0,
+        column: index1
+      }
+    when 'row'
+      return {
+        row: index0,
+        column: index1
+      }
+    when 'block'
+      return {
+        row: (index0/3)*3 + index1/3,
+        column: (index0%3)*3 + index1%3
+      }
+    end
+  end
+
+  def positions_of_values(kind, value)
+    result = {}
+     row, column = nil, nil
+     9.times do |index|
+      case kind
+      when 'column'
+        row = index
+        column = value
+      when 'row'
+        row = value
+        column = index
+      when 'block'
+        row = (value/3)*3 + index/3
+        column = (value%3)*3 + index%3
+      end
+      next if row.nil? or column.nil?
+      @revers_table[row][column].each do |value|
+        result[value] ||= []
+        result[value] << index
+      end
+    end
+    result
+  end
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  # type: "block", "row","column"
+  def cells_with_two_elements_for(type, index)
+  only_two_positions = positions_of_values(type, index).select {|k,v| v.length == 2}
+    result = {}
+    only_two_positions.each do |value, positions|
+      result[positions] ||= []
+      result[positions] << value
+    end
+    result.each do |key, value|
+      if value.size == 2
+        if type == 'block'
+          positions = positions_for('block', index, key[0])
+          @revers_table[positions[:row]][positions[:column]] = value.clone
+          positions = positions_for('block', index, key[1])
+          @revers_table[positions[:row]][positions[:column]] = value.clone
+        end
+        if type == 'row'
+          @revers_table[index][key[0]] = value.clone
+          @revers_table[index][key[1]] = value.clone
+        end
+        if type == 'column'
+          @revers_table[key[0]][index] = value.clone
+          @revers_table[key[1]][index] = value.clone
+        end
+      end
+    end
+  end
+
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_vertical_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    9.times do |index|
+      @revers_table[index][column].delete(cell) unless index == row
+    end
+  end
+
+  # erase values in hozizontal, which are that same like value from positnio row, column
+  def erase_in_horizontal_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    9.times do |index|
+      @revers_table[row][index].delete(cell) unless index == column
+    end
+  end
+
+  # erase values in block, which are that same like value from positnio row, column
+  def erase_in_block_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    first_row_block = (row/3)*3
+    first_column_block = (column/3)*3
+    3.times do |row_index|
+      row_block = first_row_block + row_index
+      3.times do |column_index|
+        column_block = first_column_block + column_index
+        @revers_table[row_block][column_block].delete(cell) unless row_block == row and column_block == column
+      end
+    end
+  end
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_vertical_three(column)
+    positions_of_values('column', column).each do |value, positions|
+      @revers_table[positions.first][column] = [value] if positions.size == 1
+    end
+  end
+
+  # erase values in horizontal, which are that same like value from positnio row, column
+  def erase_in_horizontal_three(row)
+    positions_of_values('row', row).each do |value, positions|
+      @revers_table[row][positions.first] = [value] if positions.size == 1
+    end
+  end
+
+  def cell_revers_table(row, column, value = nil)
+    @revers_table[row][column] = value unless value.nil?
+    @revers_table[row][column]
+  end
+
+end

data/lib/sudoku.rb~

@@ -0,0 +1,161 @@
+require "sudoku/version"
+
+class Sudoku
+
+  def initialize(data)
+    @revers_table = create_revers_table(data)
+  end
+
+  def solve
+    revers_table = nil
+    while not revers_table == @revers_table
+      revers_table = Marshal.load(Marshal.dump(@revers_table))
+
+      9.times do |row_index|
+      #  erase_in_vertical_two(row_index)
+       # erase_in_horizontal_two(row_index)
+       # erase_in_block_two(row_index)
+        9.times do |column_index|
+          erase_in_vertical_one(row_index, column_index)
+          erase_in_horizontal_one(row_index, column_index)
+          erase_in_block_one(row_index, column_index)
+          puts "row_index : #{row_index}  column_index: #{column_index}"
+        end
+      end
+    end
+    puts revers_table_to_result
+  end
+
+private
+
+  # table = [[[1, 2, 3, 4, 5], [], ..., []],
+  #          [[],                  ..., []],
+  #                    ...
+  #          [[],                  ..., []]
+  #         ]
+  def create_revers_table(data)
+    result = 9.times.map{|row_element| 9.times.map{|col_element| []}}
+    data.each_with_index do |cell, index|
+      column = index % 9
+      row = (index - column)/9 % 9
+      cell = cell.to_i
+      result[row][column] = [cell]
+      result[row][column] = 9.times.map{|element| element+1} if cell == 0
+    end
+    return result
+  end
+
+  def revers_table_to_result
+    revers_table = Marshal.load(Marshal.dump(@revers_table))
+    9.times.map do |row|
+      9.times.map do |columnt|
+        if revers_table[row][columnt].size == 1
+          revers_table[row][columnt] = revers_table[row][columnt].first
+        else
+          revers_table[row][columnt] = 0
+        end
+      end
+    end
+    revers_table.join.split("")
+  end
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_block_two(number)
+    start_row = (number/3)*3
+    start_column = (number%3)*3
+
+    # zamieniamy na tablicę z pozycjami dla poszczególnych wartośći w pionie
+    reverse = ([[]]*9).map{|each| []}
+    9.times do |index|
+      block_row = index/3 + start_row
+      block_column = index%3 + start_column
+      @revers_table[block_row][block_column].each { |value| reverse[value-1] << index }
+    end
+    reverse.map!{|value| value.sort}
+
+    result = []
+    reverse.each do |positions|
+      next unless reverse.count(positions) == 2
+      reverse.each_with_index { |value, index| result << index+1 if value == positions }
+      positions.each do |position| 
+        block_row = position/3 + start_row
+        block_column = position%3 + start_column
+        @revers_table[block_row][block_column] = result.uniq
+      end
+    end
+  end
+
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_vertical_two(column)
+    # zamieniamy na tablicę z pozycjami dla poszczególnych wartośći w pionie
+    reverse = ([[]]*9).map{|each| []}
+    9.times do |index|
+      @revers_table[index][column].each { |value| reverse[value-1] << index }
+    end
+    reverse.map!{|value| value.sort}
+
+    result = []
+    reverse.each do |positions|
+      next unless reverse.count(positions) == 2
+      reverse.each_with_index { |value, index| result << index+1 if value == positions }
+      positions.each { |position| @revers_table[position][column] = result.uniq }
+    end
+  end
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_horizontal_two(row)
+    # zamieniamy na tablicę z pozycjami dla poszczególnych wartośći w pionie
+    reverse = ([[]]*9).map{|each| []}
+    9.times do |index|
+      @revers_table[row][index].each { |value| reverse[value-1] << index }
+    end
+    reverse.map!{|value| value.sort}
+
+    result = []
+    reverse.each do |positions|
+      next unless reverse.count(positions) == 2
+      reverse.each_with_index { |value, index| result << index+1 if value == positions }
+      positions.each { |position| @revers_table[row][position] = result.uniq }
+    end
+  end
+
+  # erase values in vertical, which are that same like value from positnio row, column
+  def erase_in_vertical_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    9.times do |index|
+      @revers_table[index][column].delete(cell) unless index == row
+    end
+  end
+
+  # erase values in hozizontal, which are that same like value from positnio row, column
+  def erase_in_horizontal_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    9.times do |index|
+      @revers_table[row][index].delete(cell) unless index == column
+    end
+  end
+
+  # erase values in block, which are that same like value from positnio row, column
+  def erase_in_block_one(row, column)
+    return unless @revers_table[row][column].size == 1
+    cell = @revers_table[row][column][0]
+    first_row_block = (row/3)*3
+    first_column_block = (column/3)*3
+    3.times do |row_index|
+      row_block = first_row_block + row_index
+      3.times do |column_index|
+        column_block = first_column_block + column_index
+        @revers_table[row_block][column_block].delete(cell) unless row_block == row and column_block == column
+      end
+    end
+  end
+
+  def cell_revers_table(row, column, value = nil)
+    @revers_table[row][column] = value unless value.nil?
+    @revers_table[row][column]
+  end
+
+end

data/nsudoku.gemspec

@@ -0,0 +1,20 @@
+# -*- encoding: utf-8 -*-
+require File.expand_path('../lib/nsudoku/version', __FILE__)
+
+Gem::Specification.new do |gem|
+  gem.platform      = Gem::Platform::RUBY
+  gem.authors       = ["Michał Szyma"]
+  gem.email         = ["raglub.ruby@gmail.com"]
+  gem.date          = "2012-06-21"
+  gem.description   = %q{This gem solve puzzle game sudoku 9x9}
+  gem.summary       = %q{This gem solve puzzle game sudoku}
+  gem.homepage      = "http://github.com/raglub/nsudoku"
+
+  gem.files         = `git ls-files`.split($\)
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.name          = "nsudoku"
+  gem.require_paths = ["lib"]
+  gem.version       = NSudoku::VERSION
+
+  gem.add_development_dependency "rspec", ">= 2.10.0"
+end

data/spec/nsudoku_spec.rb

@@ -0,0 +1,148 @@
+# encoding: utf-8
+
+require 'nsudoku'
+
+EXAMPLE = [
+  "012000000",
+  "304052000",
+  "605170000",
+  "070208090",
+  "920700084",
+  "050906010",
+  "000320908",
+  "000580107",
+  "000000240"].join
+
+TABLE_EMPTY = [
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000",
+  "000000000"].join
+
+describe NSudoku do
+
+  it "should properly reverse base namber of table" do
+    sudoku = NSudoku.new(TABLE_EMPTY)
+    sudoku.send(:cell_revers_table, 1, 1, [1])
+    sudoku.send(:cell_revers_table, 8, 8, [3])
+    sudoku.send(:cell_revers_table, 1, 1).should eql([1])
+    sudoku.send(:cell_revers_table, 1 ,0).should eql([1, 2, 3, 4, 5, 6, 7, 8, 9])
+  end
+
+  context "should properly erase values which are that same like in cell with single element" do
+    it "in column (exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:cell_revers_table, 3, 4, [5])
+      sudoku.send(:erase_in_vertical_one, 3, 4)
+      sudoku.send(:cell_revers_table, 0, 4).should eql([1, 2, 3, 4, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 5, 4).should eql([1, 2, 3, 4, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 8, 4).should eql([1, 2, 3, 4, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 3, 4).should eql([5])
+    end
+
+    it "in column (don't exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:erase_in_vertical_one, 3, 4)
+      sudoku.send(:cell_revers_table, 5, 4).should eql([1, 2, 3, 4,5 , 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 3, 4).should eql([1, 2, 3, 4,5 , 6, 7, 8, 9])
+    end
+
+    it "in row (exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:cell_revers_table, 3, 4, [5])
+      sudoku.send(:erase_in_horizontal_one, 3, 4)
+      sudoku.send(:cell_revers_table, 3, 2).should eql([1, 2, 3, 4, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 3, 4).should eql([5])
+    end
+
+    it "in column (don't exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:erase_in_horizontal_one, 3, 4)
+      sudoku.send(:cell_revers_table, 3, 2).should eql([1, 2, 3, 4, 5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 3, 4).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+    end
+
+    it "in block (exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:cell_revers_table, 7, 3, [8])
+      sudoku.send(:erase_in_block_one, 7, 3)
+      sudoku.send(:cell_revers_table, 6, 2).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 5, 6).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 5, 3).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 7, 6).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+
+      sudoku.send(:cell_revers_table, 6, 4).should eql([1, 2, 3, 4 ,5, 6, 7, 9])
+      sudoku.send(:cell_revers_table, 8, 3).should eql([1, 2, 3, 4 ,5, 6, 7, 9])
+      sudoku.send(:cell_revers_table, 8, 5).should eql([1, 2, 3, 4 ,5, 6, 7, 9])
+      sudoku.send(:cell_revers_table, 7, 3).should eql([8])
+    end
+
+    it "in block (don't exist cell with single element)" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:erase_in_block_one, 7, 3)
+      sudoku.send(:cell_revers_table, 6, 2).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 5, 6).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+
+      sudoku.send(:cell_revers_table, 6, 4).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+      sudoku.send(:cell_revers_table, 8, 3).should eql([1, 2, 3, 4 ,5, 6, 7, 8, 9])
+    end
+  end
+
+  context "select cells with two elements (rest erase)" do
+
+    it "in block" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      3.times do |row|
+        3.times do |column|
+          sudoku.send(:cell_revers_table, row, column, [2, 3, 4, 5, 6, 7, 9])
+        end
+      end
+
+      sudoku.send(:cell_revers_table, 0, 0, [1, 5, 8])
+      sudoku.send(:cell_revers_table, 2, 2, [1, 3, 8])
+
+      sudoku.send(:cells_with_two_elements_for, "block", 0)
+      sudoku.send(:cell_revers_table, 0, 0).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 2, 2).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 1, 2).should eql([2, 3, 4, 5, 6, 7, 9])
+    end
+
+    it "in column" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:cell_revers_table, 0, 4, [1, 5, 8])
+      sudoku.send(:cell_revers_table, 1, 4, [1, 3, 8])
+      (2..8).each do |index|
+        sudoku.send(:cell_revers_table, index, 4, [2, 3, 4, 5, 6, 7, 9])
+      end
+
+      sudoku.send(:cells_with_two_elements_for, "column",  4)
+      sudoku.send(:cell_revers_table, 0, 4).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 1, 4).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 2, 4).should eql([2, 3, 4, 5, 6, 7, 9])
+    end
+
+    it "in row" do
+      sudoku = NSudoku.new(TABLE_EMPTY)
+      sudoku.send(:cell_revers_table, 4, 0, [1, 5, 8])
+      sudoku.send(:cell_revers_table, 4, 1, [1, 3, 8])
+      (2..8).each do |index|
+        sudoku.send(:cell_revers_table, 4, index, [2, 3, 4, 5, 6, 7, 9])
+      end
+
+      sudoku.send(:cells_with_two_elements_for, "row",  4)
+      sudoku.send(:cell_revers_table, 4, 0).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 4, 1).should eql([1, 8])
+      sudoku.send(:cell_revers_table, 4, 2).should eql([2, 3, 4, 5, 6, 7, 9])
+    end
+
+  end
+
+  it "solve whole sudoku" do
+    NSudoku.new(EXAMPLE).solve.should eql("712460850394852671685170420070208596926715384050906712540320968269584137030690245")
+  end
+end

metadata

@@ -0,0 +1,73 @@
+--- !ruby/object:Gem::Specification
+name: nsudoku
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Michał Szyma
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-06-21 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 2.10.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 2.10.0
+description: This gem solve puzzle game sudoku 9x9
+email:
+- raglub.ruby@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rvmrc
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- lib/nsudoku.rb
+- lib/nsudoku/version.rb
+- lib/sudoku.rb~
+- nsudoku.gemspec
+- spec/nsudoku_spec.rb
+homepage: http://github.com/raglub/nsudoku
+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.24
+signing_key: 
+specification_version: 3
+summary: This gem solve puzzle game sudoku
+test_files:
+- spec/nsudoku_spec.rb