z3 0.0.20160330 → 0.0.20160427

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 9b616eadc04d3acebed002b5e30969543ec87288
-  data.tar.gz: 51b12ceac3ca413e11d445c21524aa709e0d0c86
+  metadata.gz: b373cf9a8caebd1c5a05420660ac2301528613eb
+  data.tar.gz: 4c45e3aa7326aeaefddee63a17c8a4eeb1fe57e0
 SHA512:
-  metadata.gz: 755c4a975d120202b93efe203d3eeea53dc7898a0a15b8008c287bc7821c773f5e88a73680dd32eb4acfcd55208659c55591ee9151a06056884e2760101492a3
-  data.tar.gz: 5bc45fa1e31598830ce699b55cccbfac82ed9f83b72d9700fd454ecc2d05f68800bad0d2f8c2dc9f6485163b1ada994cfdd233323a52e49af1f142fa8107673e
+  metadata.gz: 6a2bd8245fcb32c67f0c609b477842a6f804fcc45d514f7d8d7a8ec047c8e6e70875167562aef1c51d04b637c900f001d4ad8e35368005f9aa3c7990239ab841
+  data.tar.gz: 73efd05c6292e8ef129c8a711a7de4b5a377c585991a11f4fe6930763c9e9e9ead23cc36fa98caba35966d9d7e5f897509ee7bb5bf003ff355d3ad2001b731f0

data/README.md

@@ -27,3 +27,7 @@ On other systems use appropriate package manager.
 Ruby API tries to catch the most common mistakes, but if you use API in a weird way you can get C crash instead of nice Ruby exception.
 
 Memory will leak a good deal. Generally avoid in long running processes.
+
+### Python versions
+
+Most of example solvers have Python versions available from https://github.com/taw/puzzle-solvers

data/examples/{bridges_solver → bridges}

@@ -1,9 +1,11 @@
 #!/usr/bin/env ruby
 
+require "pathname"
 require_relative "../lib/z3"
 
 class Bridges
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
     data = data.strip.split("\n").map do |line|
       line.split.map{|c| c == "_" ? nil : c.to_i}
     end
@@ -119,14 +121,5 @@ class Bridges
   end
 end
 
-Bridges.new(
-"""
-3 _ _ 6 _ _ 4
-_ 1 _ _ _ _ _
-_ _ _ 4 _ 4 _
-_ _ _ _ _ _ _
-_ _ 1 _ 3 _ _
-1 _ _ _ _ 2 _
-_ 3 _ _ 5 _ 3
-"""
-).solve!
+path = ARGV[0] || Pathname(__dir__) + "bridges-1.txt"
+Bridges.new(path).solve!

data/examples/bridges-1.txt

@@ -0,0 +1,7 @@
+3 _ _ 6 _ _ 4
+_ 1 _ _ _ _ _
+_ _ _ 4 _ 4 _
+_ _ _ _ _ _ _
+_ _ 1 _ 3 _ _
+1 _ _ _ _ 2 _
+_ 3 _ _ 5 _ 3

data/examples/four_hackers_puzzle

@@ -62,8 +62,9 @@ class LogicPuzzle
     add_assertions!
     if @solver.check == :sat
       @solver.model.each do |k,v|
+        k = k.to_s.gsub("|", "")
         i, name = k.split("-", 2)
-        puts "#{k} = #{@dict[name][v.to_i]}"
+        puts "#{k} = #{@dict[name][v.to_s.to_i]}"
       end
     else
       puts "Puzzle has no solutions"

data/examples/{kakuro_solver → kakuro}

@@ -10,10 +10,12 @@ class Hash
   end
 end
 
+require "pathname"
 require_relative "../lib/z3"
 
 class Kakuro
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
     data = data.strip.split("\n").map do |line|
       line.split.map{|cell| parse_cell(cell)}
     end
@@ -108,17 +110,5 @@ class Kakuro
   end
 end
 
-Kakuro.new(
-"""
-  x     x     x   10/   24/   29/     x   11/   21/   10/
-  x   11/   19/24   _     _     _     /6    _     _     _
-  /31   _     _     _     _     _   10/20   _     _     _
-  /4    _     _   22/18   _     _     _   23/13   _     _
-  /18   _     _     _   24/26   _     _     _     _     _
-  x   19/   30/16   _     _   10/11   _     _   11/   20/
-  /34   _     _     _     _     _   23/23   _     _     _
-  /7    _     _    9/16   _     _     _    3/4    _     _
-  /24   _     _     _     /23   _     _     _     _     _
-  /10   _     _     _     /11   _     _     _     x     x
-"""
-).solve!
+path = ARGV[0] || Pathname(__dir__) + "kakuro-1.txt"
+Kakuro.new(path).solve!

data/examples/kakuro-1.txt

@@ -0,0 +1,10 @@
+  x     x     x   10/   24/   29/     x   11/   21/   10/
+  x   11/   19/24   _     _     _     /6    _     _     _
+  /31   _     _     _     _     _   10/20   _     _     _
+  /4    _     _   22/18   _     _     _   23/13   _     _
+  /18   _     _     _   24/26   _     _     _     _     _
+  x   19/   30/16   _     _   10/11   _     _   11/   20/
+  /34   _     _     _     _     _   23/23   _     _     _
+  /7    _     _    9/16   _     _     _    3/4    _     _
+  /24   _     _     _     /23   _     _     _     _     _
+  /10   _     _     _     /11   _     _     _     x     x

data/examples/{knights_puzzle_solver → knights_puzzle}

@@ -12,13 +12,13 @@ class KnightsPuzzle
     @moves = @num_moves.times.map{|t| move(t)}
     setup_board @boards[0], """
     bbb.
-    xb.w
+    xbxw
     ..ww
     x.xw
     """
     setup_board @boards[-1], """
     www.
-    xw.b
+    xwxb
     ..bb
     x.xb
     """
@@ -29,11 +29,11 @@ class KnightsPuzzle
 
   def print_board(t)
     puts "State #{t}:"
-    puts @boards[t].transpose.map{|row| row.map{|c| ".wbx"[@model[c].to_i]}.join }.join("\n")
+    puts @boards[t].transpose.map{|row| row.map{|c| ".wbx"[@model[c].to_s.to_i]}.join }.join("\n")
   end
 
   def print_move(t)
-    move = Hash[@moves[t].map{|k,v| [k,@model[v].to_i]}]
+    move = Hash[@moves[t].map{|k,v| [k,@model[v].to_s.to_i]}]
     figure = " wbx"[move[:figure]]
     puts "#{figure}: #{move[:start_x]},#{move[:start_y]} -> #{move[:end_x]},#{move[:end_y]}"
     puts ""

data/examples/{letter_connections_solver → letter_connections}

@@ -17,10 +17,13 @@
 #
 # This affects few enough real world puzzles and would complicate solution enough
 # that I let it be.
+
+require "pathname"
 require_relative "../lib/z3"
 
 class LetterConnections
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
     data = data.strip.split("\n")
     @xsize = data[0].size
     @ysize = data.size
@@ -183,17 +186,5 @@ class LetterConnections
   end
 end
 
-LetterConnections.new(
-"""
-..KJ....FE
-.FJ.......
-......G...
-.K.I......
-.......D..
-IE......B.
-...H...CD.
-...A..C...
-.A.H......
-...B.G....
-"""
-).solve!
+path = ARGV[0] || Pathname(__dir__) + "letter_connections-1.txt"
+LetterConnections.new(path).solve!

data/examples/letter_connections-1.txt

@@ -0,0 +1,10 @@
+..KJ....FE
+.FJ.......
+......G...
+.K.I......
+.......D..
+IE......B.
+...H...CD.
+...A..C...
+.A.H......
+...B.G....

data/examples/{light_up_solver → light_up}

@@ -1,9 +1,11 @@
 #!/usr/bin/env ruby
 
+require "pathname"
 require_relative "../lib/z3"
 
 class LightUp
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
     data = data.split.map{|line| line.strip.chars}
     @xsize = data[0].size
     @ysize = data.size
@@ -92,14 +94,5 @@ class LightUp
   end
 end
 
-LightUp.new(
-"""
-....0..
-.......
-x.2.x..
-...3...
-..x.x.3
-.......
-..1....
-"""
-).solve!
+path = ARGV[0] || Pathname(__dir__) + "light_up-1.txt"
+LightUp.new(path).solve!

data/examples/light_up-1.txt

@@ -0,0 +1,7 @@
+....0..
+.......
+x.2.x..
+...3...
+..x.x.3
+.......
+..1....

data/examples/{minisudoku_solver → minisudoku}

@@ -1,9 +1,14 @@
 #!/usr/bin/env ruby
 
+require "pathname"
 require_relative "../lib/z3"
 
 class MiniSudokuSolver
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
+    data = data.strip.split("\n").map do |line|
+      line.split.map{|c| c == "_" ? nil : c.to_i}
+    end
     @data = data
     @solver = Z3::Solver.new
   end
@@ -52,13 +57,5 @@ class MiniSudokuSolver
   end
 end
 
-_ = nil
-minisudoku = MiniSudokuSolver.new([
-  [_, _, _, 4, _, _],
-  [_, _, 4, 1, 2, _],
-  [_, _, 6, 5, 4, _],
-  [_, 5, 2, 3, _, _],
-  [_, 2, 3, 6, _, _],
-  [_, _, 1, _, _, _],
-])
-minisudoku.solve!
+path = ARGV[0] || Pathname(__dir__) + "minisudoku-1.txt"
+MiniSudokuSolver.new(path).solve!

data/examples/minisudoku-1.txt

@@ -0,0 +1,6 @@
+_ _ _ 4 _ _
+_ _ 4 1 2 _
+_ _ 6 5 4 _
+_ 5 2 3 _ _
+_ 2 3 6 _ _
+_ _ 1 _ _ _

data/examples/nonogram

@@ -0,0 +1,152 @@
+#!/usr/bin/env ruby
+
+require_relative "../lib/z3"
+
+class Nonogram
+  def initialize(columns, rows)
+    @columns = columns
+    @rows = rows
+    @solver = Z3::Solver.new
+    @xsize = @columns.size
+    @ysize = @rows.size
+  end
+
+  def print_answer!
+    @ysize.times do |y|
+      @xsize.times do |x|
+        v = @model[@cells[y][x]]
+        if v.to_s == "true"
+          print "\u2588"
+        else
+          print "\u00b7"
+        end
+      end
+      print "\n"
+    end
+  end
+
+  def print_all_answers!
+    if @solver.check == :sat
+      @model = @solver.model
+      print_answer!
+      current_solution = []
+      # TODO: Model API doesn't currently have functionality necessary
+      #       to make uniqueness checks work
+      # @model.each do |var, val|
+      #   current_solution << (@model[var] != val)
+      # end
+      # @solver.assert Z3.Or(*current_solution)
+      # if @solver.check == :sat
+      #   puts "solution is not unique"
+      #   print_answer!
+      # else
+      #   puts "solution is unique"
+      # end
+    else
+      puts "failed to solve"
+    end
+  end
+
+  def setup_vars(nums, prefix, size)
+    results = []
+    (0...nums.size).each do |i|
+      vs = Z3.Int("#{prefix},#{i+1},s")
+      ve = Z3.Int("#{prefix},#{i+1},e")
+      @solver.assert ve-vs == nums[i]-1
+      @solver.assert vs >= 0
+      @solver.assert ve < size
+      results << [vs,ve]
+    end
+
+    (0...nums.size-1).each do |i|
+      ve0 = results[i][1]
+      vs1 = results[i+1][0]
+      @solver.assert vs1 >= ve0+2
+    end
+
+    results
+  end
+
+  def setup_cell_constraints(cells, cvars)
+    (0...cells.size).each do |i|
+      rule_i = Z3.Or(
+        *cvars.map{|vs,ve| Z3.And(vs <= i, i <= ve) }
+      )
+      @solver.assert cells[i] == rule_i
+    end
+  end
+
+  def solve!
+    @cells = (0...@ysize).map{|y|
+      (0...@xsize).map{|x|
+        Z3.Bool("cell[#{x+1},#{y+1}]")
+      }
+    }
+
+    @column_vars = (0...@xsize).map{|i|
+      setup_vars(@columns[i], "c%d" % (i+1), @ysize)
+    }
+    @row_vars = (0...@ysize).map{|i|
+      setup_vars(@rows[i], "r%d" % (i+1), @xsize)
+    }
+
+    @xsize.times do |i|
+      setup_cell_constraints(@cells.map{|row| row[i]}, @column_vars[i])
+    end
+
+    @ysize.times do |i|
+      setup_cell_constraints(@cells[i], @row_vars[i])
+    end
+
+    print_all_answers!
+  end
+end
+
+nonogram = Nonogram.new(
+  [
+    [2],
+    [1,2],
+    [2,3],
+    [2,3],
+    [3,1,1],
+    [2,1,1],
+    [1,1,1,2,2],
+    [1,1,3,1,3],
+    [2,6,4],
+    [3,3,9,1],
+    [5,3,2],
+    [3,1,2,2],
+    [2,1,7],
+    [3,3,2],
+    [2,4],
+    [2,1,2],
+    [2,2,1],
+    [2,2],
+    [1],
+    [1],
+  ],
+  [
+    [3],
+    [5],
+    [3,1],
+    [2,1],
+    [3,3,4],
+    [2,2,7],
+    [6,1,1],
+    [4,2,2],
+    [1,1],
+    [3,1],
+    [6],
+    [2,7],
+    [6,3,1],
+    [1,2,2,1,1],
+    [4,1,1,3],
+    [4,2,2],
+    [3,3,1],
+    [3,3],
+    [3],
+    [2,1],
+  ]
+)
+
+nonogram.solve!

data/examples/{sudoku_solver → sudoku}

@@ -1,9 +1,15 @@
 #!/usr/bin/env ruby
 
+
+require "pathname"
 require_relative "../lib/z3"
 
 class SudokuSolver
-  def initialize(data)
+  def initialize(path)
+    data = Pathname(path).read
+    data = data.strip.split("\n").map do |line|
+      line.split.map{|c| c == "_" ? nil : c.to_i}
+    end
     @data = data
     @solver = Z3::Solver.new
   end
@@ -52,16 +58,5 @@ class SudokuSolver
   end
 end
 
-_ = nil
-sudoku = SudokuSolver.new([
-  [_, 6, _, 5, _, 9, _, 4, _],
-  [9, 2, _, _, _, _, _, 7, 6],
-  [_, _, 1, _, _, _, 9, _, _],
-  [7, _, _, 6, _, 3, _, _, 9],
-  [_, _, _, _, _, _, _, _, _],
-  [3, _, _, 4, _, 1, _, _, 7],
-  [_, _, 6, _, _, _, 7, _, _],
-  [2, 4, _, _, _, _, _, 6, 5],
-  [_, 9, _, 1, _, 8, _, 3, _],
-])
-sudoku.solve!
+path = ARGV[0] || Pathname(__dir__) + "sudoku-1.txt"
+SudokuSolver.new(path).solve!