euler 1.0.8 → 1.1.0

data/.gitignore

@@ -1,2 +1,3 @@
 .DS_Store
-pkg/*
+pkg/*
+rdoc/*

data/README.rdoc

@@ -1,18 +1,37 @@
 = euler
 
-Description goes here.
+== DESCRIPTION
 
-== Note on Patches/Pull Requests
+libeuler is a simple library you can include in your code to take away some of the boring repetitive parts of solving Project Euler problems.
+
+== FEATURES
+
+* Adds various methods to the Integer class, such as factorial, prime?, is_fibonacci?, etc.
+* Provides various module methods, such as generate_sieve, get_primes, etc.
+
+== SYNOPSIS
+
+	require 'rubygems'
+	require 'euler'
+	
+	5.factorial # => 120
+
+== REQUIREMENTS
+
+* none
+
+== INSTALL
+
+* sudo gem install euler
+
+== COLLABORATION
  
 * Fork the project.
 * Make your feature addition or bug fix.
-* Add tests for it. This is important so I don't break it in a
-  future version unintentionally.
-* Commit, do not mess with rakefile, version, or history.
-  (if you want to have your own version, that is fine but
-   bump version in a commit by itself I can ignore when I pull)
+* Add tests for it. This is important so I don't break it in a future version unintentionally.
+* Commit, do not mess with rakefile, version, or history. (if you want to have your own version, that is fine but bump version in a commit by itself I can ignore when I pull)
 * Send me a pull request. Bonus points for topic branches.
 
-== Copyright
+== COPYRIGHT
 
-Copyright (c) 2009 Mike Skalnik. See LICENSE for details.
+Copyright (c) 2009 Mike Skalnik, Nick Kezhaya. See LICENSE for details.

data/Rakefile

@@ -9,8 +9,14 @@ begin
     gem.description = %Q{A gem that provides a small library to help in removing the repetativeness of solving Project Euler problems.}
     gem.email = "mike.skalnik@gmail.com"
     gem.homepage = "http://github.com/skalnik/euler"
-    gem.authors = ["Mike Skalnik"]
+    gem.authors = ["Mike Skalnik", "Nick Kezhaya"]
+    gem.rubyforge_project = 'euler'
   end
+  
+  Jeweler::RubyforgeTasks.new do |rubyforge|
+    rubyforge.doc_task = 'rdoc'
+  end
+  Jeweler::GemcutterTasks.new
 rescue LoadError
   puts "Jeweler (or a dependency) not available. Install it with: sudo gem install jeweler"
 end
@@ -51,4 +57,4 @@ Rake::RDocTask.new do |rdoc|
   rdoc.title = "euler #{version}"
   rdoc.rdoc_files.include('README*')
   rdoc.rdoc_files.include('lib/**/*.rb')
-end
+end

data/VERSION

@@ -1 +1 @@
-1.0.8
+1.1.0

data/euler.gemspec

@@ -0,0 +1,55 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE
+# Instead, edit Jeweler::Tasks in Rakefile, and run `rake gemspec`
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{euler}
+  s.version = "1.1.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Mike Skalnik", "Nick Kezhaya"]
+  s.date = %q{2009-10-11}
+  s.description = %q{A gem that provides a small library to help in removing the repetativeness of solving Project Euler problems.}
+  s.email = %q{mike.skalnik@gmail.com}
+  s.extra_rdoc_files = [
+    "LICENSE",
+     "README.rdoc"
+  ]
+  s.files = [
+    ".gitignore",
+     "LICENSE",
+     "README.rdoc",
+     "Rakefile",
+     "VERSION",
+     "euler.gemspec",
+     "lib/euler.rb",
+     "lib/rudoku.rb",
+     "test/tc_integer_methods.rb",
+     "test/tc_module.rb",
+     "test/tc_rudoku.rb",
+     "test/test_euler.rb"
+  ]
+  s.homepage = %q{http://github.com/skalnik/euler}
+  s.rdoc_options = ["--charset=UTF-8"]
+  s.require_paths = ["lib"]
+  s.rubyforge_project = %q{euler}
+  s.rubygems_version = %q{1.3.5}
+  s.summary = %q{A small library to help solve Projet Euler problems.}
+  s.test_files = [
+    "test/tc_integer_methods.rb",
+     "test/tc_module.rb",
+     "test/tc_rudoku.rb",
+     "test/test_euler.rb"
+  ]
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
+    else
+    end
+  else
+  end
+end

data/lib/euler.rb

@@ -173,7 +173,25 @@ module Euler
     return Math.sqrt(c**2 - a**2) if b.nil?
     return Math.sqrt(a**2 + b**2) if c.nil?
   end
-  
+
+  # Solves a Sudoku puzzle passed in as a 2D array.
+  #   Euler.solve_sudoku(
+  #     [[0, 0, 3, 0, 2, 0, 6, 0, 0],
+  #     [9, 0, 0, 3, 0, 5, 0, 0, 1],
+  #     [0, 0, 1, 8, 0, 6, 4, 0, 0],
+  #     [0, 0, 8, 1, 0, 2, 9, 0, 0],
+  #     [7, 0, 0, 0, 0, 0, 0, 0, 8],
+  #     [0, 0, 6, 7, 0, 8, 2, 0, 0],
+  #     [0, 0, 2, 6, 0, 9, 5, 0, 0],
+  #     [8, 0, 0, 2, 0, 3, 0, 0, 9],
+  #     [0, 0, 5, 0, 1, 0, 3, 0, 0]]
+  #   ) # => [[4, 8, 3, 9, 2, 1, 6, 5, 7], [9, 6, 7, 3, 4, 5, 8, 2, 1], [2, 5, 1, 8, 7, 6, 4, 9, 3], [5, 4, 8, 1, 3, 2, 9, 7, 6], [7, 2, 9, 5, 6, 4, 1, 3, 8], [1, 3, 6, 7, 9, 8, 2, 4, 5], [3, 7, 2, 6, 8, 9, 5, 1, 4], [8, 1, 4, 2, 5, 3, 7, 6, 9], [6, 9, 5, 4, 1, 7, 3, 8, 2]]
+  def solve_sudoku(puzzle)
+    require File.dirname(__FILE__) + "/rudoku"
+    rudoku = Rudoku.new(puzzle)
+    rudoku.backtrack_solve
+    rudoku.to_a
+  end
 end
 
 # Just adds Euler::IntegerMethods to the Integer class.

data/lib/rudoku.rb

@@ -0,0 +1,178 @@
+class Rudoku
+  def initialize(sudoku)
+    @n = sudoku.size
+    @sqrt_n = Math.sqrt(@n).to_i
+    raise "wrong sudoku size" unless @sqrt_n * @sqrt_n == @n
+
+    @arr = sudoku.collect { |row|
+      (0...@n).collect { |i|
+        ((1..@n) === row[i]) ? [row[i]] : (1..@n).to_a
+      }
+    }
+
+    @rfix = Array.new(@n) { [] }
+    @cfix = Array.new(@n) { [] }
+    @bfix = Array.new(@n) { [] }
+    @n.times { |r| @n.times { |c| update_fix(r, c) } }
+
+    [@rfix, @cfix, @bfix].each { |fix| fix.each { |x|
+      unless x.size == x.uniq.size
+        raise "non-unique numbers in row, col or box"
+      end
+    } }
+  end
+
+  def solve
+    begin
+      until finished?
+        progress = false
+        while reduce
+          progress = true
+        end
+        progress = true if deduce
+        return :unknown unless progress
+      end
+      :solved
+    rescue
+      :impossible
+    end
+  end
+
+  def backtrack_solve
+    if (res = solve) == :unknown
+      r, c = 0, 0
+      @rfix.each_with_index { |rf, r|
+        break if rf.size < @n
+      }
+      @arr[r].each_with_index { |x, c|
+        break if x.size > 1
+      }
+      partial = to_a
+      solutions = []
+      @arr[r][c].each { |guess|
+        partial[r][c] = guess
+        rsolver = Rudoku.new(partial)
+        case rsolver.backtrack_solve
+        when :multiple_solutions
+        initialize(rsolver.to_a)
+        return :multiple_solutions
+        when :solved
+        solutions << rsolver
+        end
+      }
+      if solutions.empty?
+        return :impossible
+      else
+        initialize(solutions[0].to_a)
+        return solutions.size > 1 ? :multiple_solutions : :solved
+      end
+    end
+    res
+  end
+
+  def to_a
+    @arr.collect { |row| row.collect { |x|
+      (x.size == 1) ? x[0] : nil
+    } }
+  end
+
+  def to_s
+    fw = @n.to_s.size
+    to_a.collect { |row| row.collect { |x|
+      (x ? x.to_s : "_").rjust(fw)
+    }.join " " }.join "\n"
+  end
+
+  def finished?
+    @arr.each { |row| row.each { |x| return false if x.size > 1 } }
+    true
+  end
+
+  def reduce
+    success = false
+    @n.times { |r| @n.times { |c|
+      if (sz = @arr[r][c].size) > 1
+        @arr[r][c] = @arr[r][c] -
+        (@rfix[r] | @cfix[c] | @bfix[rc2box(r, c)])
+        raise "impossible to solve" if @arr[r][c].empty?
+        if @arr[r][c].size < sz
+          success = true
+          update_fix(r, c)
+        end
+      end
+    } }
+    success
+  end
+
+  def deduce
+    success = false
+    [:col_each, :row_each, :box_each].each { |meth|
+      @n.times { |i|
+        u = uniqs_in(meth, i)
+        unless u.empty?
+          send(meth, i) { |x|
+            if x.size > 1 && ((u2 = u & x).size == 1)
+              success = true
+              u2
+            else
+              nil
+            end
+          }
+          return success if success
+        end
+      }
+    }
+    success
+  end
+
+private
+  def rc2box(r, c)
+    (r - (r % @sqrt_n)) + (c / @sqrt_n)
+  end
+
+  def update_fix(r, c)
+    if @arr[r][c].size == 1
+      @rfix[r] << @arr[r][c][0]
+      @cfix[c] << @arr[r][c][0]
+      @bfix[rc2box(r, c)] << @arr[r][c][0]
+    end
+  end
+
+  def row_each(r)
+    @n.times { |c|
+      if (res = yield(@arr[r][c]))
+        @arr[r][c] = res
+        update_fix(r, c)
+      end
+    }
+  end
+
+  def col_each(c)
+    @n.times { |r|
+      if (res = yield(@arr[r][c]))
+        @arr[r][c] = res
+        update_fix(r, c)
+      end
+    }
+  end
+
+  def box_each(b)
+    off_r, off_c = (b - (b % @sqrt_n)), (b % @sqrt_n) * @sqrt_n
+    @n.times { |i|
+      r, c = off_r + (i / @sqrt_n), off_c + (i % @sqrt_n)
+      if (res = yield(@arr[r][c]))
+        @arr[r][c] = res
+        update_fix(r, c)
+      end
+    }
+  end
+
+  def uniqs_in(each_meth, index)
+    h = Hash.new(0)
+    send(each_meth, index) { |x|
+      x.each { |n| h[n] += 1 } if x.size > 1
+      nil
+    }
+    h.select { |k, v| v == 1 }.collect { |k, v| k }
+  end
+end

data/test/tc_integer_methods.rb

@@ -1,6 +1,6 @@
 require "test/unit"
 
-require "euler"
+require File.dirname(__FILE__) + "/../lib/euler"
 
 class TestIntegerMethods < Test::Unit::TestCase
   def test_factorial
@@ -42,4 +42,4 @@ class TestIntegerMethods < Test::Unit::TestCase
     assert_equal(2, 10.length, "10 has a length of 2")
     assert_equal(4, 4563.length, "4563 has a length of 4")
   end
-end
+end

data/test/tc_module.rb

@@ -1,6 +1,6 @@
 require "test/unit"
 
-require "euler"
+require File.dirname(__FILE__) + "/../lib/euler"
 
 class TestModule < Test::Unit::TestCase
   def test_sieve
@@ -37,4 +37,4 @@ class TestModule < Test::Unit::TestCase
     assert_equal(4, Euler.find_missing_pyth_value(3, nil, 5))
     assert_equal(5, Euler.find_missing_pyth_value(3, 4, nil))
   end
-end
+end

data/test/tc_rudoku.rb

@@ -0,0 +1,28 @@
+require "test/unit"
+
+require File.dirname(__FILE__) + "/../lib/euler"
+
+class TestRudoku < Test::Unit::TestCase
+  def test_rudoku
+    assert_equal([[4, 8, 3, 9, 2, 1, 6, 5, 7],
+      [9, 6, 7, 3, 4, 5, 8, 2, 1],
+      [2, 5, 1, 8, 7, 6, 4, 9, 3],
+      [5, 4, 8, 1, 3, 2, 9, 7, 6],
+      [7, 2, 9, 5, 6, 4, 1, 3, 8],
+      [1, 3, 6, 7, 9, 8, 2, 4, 5],
+      [3, 7, 2, 6, 8, 9, 5, 1, 4],
+      [8, 1, 4, 2, 5, 3, 7, 6, 9],
+      [6, 9, 5, 4, 1, 7, 3, 8, 2]],
+      Euler.solve_sudoku([[0, 0, 3, 0, 2, 0, 6, 0, 0],
+      [9, 0, 0, 3, 0, 5, 0, 0, 1],
+      [0, 0, 1, 8, 0, 6, 4, 0, 0],
+      [0, 0, 8, 1, 0, 2, 9, 0, 0],
+      [7, 0, 0, 0, 0, 0, 0, 0, 8],
+      [0, 0, 6, 7, 0, 8, 2, 0, 0],
+      [0, 0, 2, 6, 0, 9, 5, 0, 0],
+      [8, 0, 0, 2, 0, 3, 0, 0, 9],
+      [0, 0, 5, 0, 1, 0, 3, 0, 0]]
+      )
+    )
+  end
+end

data/test/test_euler.rb

@@ -1,4 +1,5 @@
 #!/usr/bin/env ruby
 require 'test/unit/testsuite'
 require 'tc_integer_methods.rb'
-require 'tc_module.rb'
+require 'tc_module.rb'
+require 'tc_rudoku.rb'

metadata

@@ -1,10 +1,11 @@
 --- !ruby/object:Gem::Specification 
 name: euler
 version: !ruby/object:Gem::Version 
-  version: 1.0.8
+  version: 1.1.0
 platform: ruby
 authors: 
 - Mike Skalnik
+- Nick Kezhaya
 autorequire: 
 bindir: bin
 cert_chain: []
@@ -22,17 +23,18 @@ extensions: []
 extra_rdoc_files: 
 - LICENSE
 - README.rdoc
-- README.txt
 files: 
 - .gitignore
 - LICENSE
 - README.rdoc
-- README.txt
 - Rakefile
 - VERSION
+- euler.gemspec
 - lib/euler.rb
+- lib/rudoku.rb
 - test/tc_integer_methods.rb
 - test/tc_module.rb
+- test/tc_rudoku.rb
 - test/test_euler.rb
 has_rdoc: true
 homepage: http://github.com/skalnik/euler
@@ -57,7 +59,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
   version: 
 requirements: []
 
-rubyforge_project: 
+rubyforge_project: euler
 rubygems_version: 1.3.5
 signing_key: 
 specification_version: 3
@@ -65,4 +67,5 @@ summary: A small library to help solve Projet Euler problems.
 test_files: 
 - test/tc_integer_methods.rb
 - test/tc_module.rb
+- test/tc_rudoku.rb
 - test/test_euler.rb

data/README.txt

@@ -1,55 +0,0 @@
-= euler
-
-== DESCRIPTION:
-
-libeuler is a simple library you can include in your code to take away some of the boring repetitive parts of solving Project Euler problems.
-
-== FEATURES:
-
-* Adds various methods to the Integer class, such as factorial, prime?, is_fibonacci?, etc.
-* Provides various module methods, such as generate_sieve, get_primes, etc.
-
-== SYNOPSIS:
-
-	require 'rubygems'
-	require 'euler'
-	
-	5.factorial # => 120
-
-== REQUIREMENTS:
-
-* none
-
-== INSTALL:
-
-* sudo gem install euler
-
-== LICENSE:
-
-(BSD License)
-
-Copyright (c) 2008, Mike "Oompa" Skalnik ("THE AUTHOR")
-All rights reserved. mike.skalnik@gmail.com
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-    * Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in the
-      documentation and/or other materials provided with the distribution.
-    * Neither the name of the author nor the
-      names of its contributors may be used to endorse or promote products
-      derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY
-EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
-DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-