ludy 0.0.7 → 0.0.8

data/CHANGES

@@ -1,6 +1,26 @@
 
 ==============================
-ludy 0.0.7
+ludy TODO
+  Proc#bind
+  multi
+  chain travel
+  method hook
+
+==============================
+ludy 0.0.8, 2007.12.06
+
+1. ludy_ext:
+  added:
+    1. Array#untranspose!
+    2. Array#unzip!
+
+  changed:
+    1. Kernel#curry support Symbol
+
+2. puzzle_generator added...
+
+==============================
+ludy 0.0.7, 2007.10.08
 
 1. ludy_ext:
   added:

data/lib/ludy/ludy_ext.rb

@@ -85,7 +85,9 @@ class Array
     }
     result
   end
-  def unzip; self.untranspose.first; end
+  def untranspose!; replace untranspose; end
+  def unzip; untranspose.first; end
+  def unzip!; replace unzip; end
 end
 
 class Proc
@@ -113,7 +115,8 @@ end
 module Kernel
   def id a = nil; a.nil? ? self : a; end
   def curry
-    class << self
+    result = self.kind_of?(Symbol) ? self.to_proc : self
+    class << result
       alias_method :orig_call, :call
       def call *args, &block
         if self.arity == -1
@@ -137,6 +140,6 @@ module Kernel
       end
       alias_method :[], :call
     end
-    self
+    result
   end
 end

data/lib/puzzle_generator/chain.rb

@@ -0,0 +1,33 @@
+
+require File.join(File.dirname(__FILE__), 'misc')
+
+module PuzzleGenerator
+
+  class Chain
+    include Enumerable
+    def initialize position = [0, 0], direct = Up, invoke = DefaultOption[:invoke]
+      @direct = direct
+      x, y = position
+      @data = case @direct
+                when Up   : ([x]*invoke).zip((y...y+invoke).to_a)
+                when Right: (x...x+invoke).to_a.zip([y]*invoke)
+                when Left : (x-invoke+1..x).to_a.zip([y]*invoke)
+              end
+    end
+    def <=> rhs; @data <=> rhs.instance_variable_get('@data'); end
+    def == rhs; (self <=> rhs) == 0; end
+    def each &block; @data.each &block; self end
+    def [] index; @data[index]; end
+    def to_a; @data.clone; end
+    def up?; @direct == Up; end
+    def bound_ok? max_width, max_height
+      not @data.find{ |i|
+        i.first >= max_width ||
+        i.last >= max_height ||
+        i.first < 0          ||
+        i.last < 0
+      }
+    end
+  end
+
+end

data/lib/puzzle_generator/chained_map.rb

@@ -0,0 +1,116 @@
+
+pwd = File.dirname __FILE__
+
+require File.join(pwd, 'misc')
+require File.join(pwd, 'chain')
+require File.join(pwd, 'map')
+
+require 'rubygems'
+
+gem 'ludy', '>=0.0.7'   # for Array#combine
+require 'ludy/ludy_ext'
+
+gem 'facets', '>=2.0.0' # for lots of things
+require 'facets/random' # for Array#pick
+
+module PuzzleGenerator
+
+  # 1. put a chain
+  # 2. destroy a chain by chain
+  # 2. a. choose a position by last map
+  # 2. b. choose a direct from 3 direct (memo p+d)
+  # 2. c. check if the position + direct is ok? ok pass, failed choose again
+  # 2. d. goto 2
+
+  class ChainedMap
+    include DisplayMap, MapUtils
+    attr_reader :maps, :option
+    def initialize option = {}
+      @option = DefaultOption.merge option
+      raise_if_bad_argument
+      init_map
+      @result_map = begin  next_level until @maps.size >= @option[:level]; put_fire_point
+                    rescue GenerationFailed; $! end
+    end
+
+    private
+    def raise_if_bad_argument
+      msg = []
+      @option.each{ |name, value| msg << "#{name} should be greater than 1." if value <= 1 }
+      raise ArgumentError.new(msg.join("\n")) unless msg.empty?
+    end
+    def make_map; Map.new @option; end
+    def init_map
+      @maps = [make_map]
+      @result_map = make_map_array
+      @picked_chain = make_init_chains([(0..@option[:width]-@option[:invoke]), [0]].combos).pick
+      put_picked_chain_on @maps
+      resolve_map
+    end
+    # please make this init chain to variable length chain
+    def make_init_chains positions
+      positions.inject([]){ |result, pos| result << Chain.new(pos, Right, @option[:invoke]) }
+    end
+
+    def chain_ok?
+      raise GenerationFailed.new("ChainedMap: last result_map: #{@result_map.inspect}") if @picked_chain.nil?
+      @maps_preview = @maps.deep_clone
+      put_picked_chain_on @maps_preview
+
+      result = check_overlap_and_resolve_it &&
+               check_broken_except_last     &&
+               check_answer_correctness(@result_map_preview) # need this if you gen variable length chain
+
+      @maps_preview = nil
+      @result_map_preview = nil
+      result
+    end
+    def next_level new_map = nil
+      @maps << (new_map || make_map)
+      chains = @maps[-1].break_chains @maps[-2], @result_map
+
+      @picked_chain = chains.pick!
+      @picked_chain = chains.pick! until chain_ok?
+
+      put_picked_chain_on @maps
+      @picked_chain = nil
+      resolve_map
+    end
+    def put_fire_point; next_level Map.new(@option.merge(:invoke => 1, :invoke_max => 1)); end
+    def put_picked_chain_on maps
+      maps.last.chains << @picked_chain
+      @picked_chain.each{ |pos|
+        x, y = pos
+        maps.each{ |map|
+          column = map[x]
+          column.replace(column[0...y] + column[y..-1].rotate)
+        }
+        maps.last[x, y] = maps.size
+      }
+    end
+    def check_overlap_and_resolve_it
+      @result_map_preview = @maps_preview.body.inject(make_map_array){ |result, map|
+        result.each_with_index{ |column, x|
+          column.each_with_index{ |value, y|
+            # assert one of them is zero or they are all zero
+            return false unless value * map[x, y] == 0
+          }
+        }
+        combine_map result, map
+      }
+    end
+    def check_broken_except_last
+      @maps_preview.body.all?{ |map|
+        result = true
+        map.each_with_index_2d{ |i, x, y|
+          result &&= !check_left_chain( map, x, y) &&
+                     !check_right_chain(map, x, y) &&
+                     !check_up_chain(   map, x, y) &&
+                     !check_down_chain( map, x, y)
+        }
+        result
+      }
+    end
+  end
+
+end

data/lib/puzzle_generator/colored_map.rb

@@ -0,0 +1,59 @@
+
+require File.join(File.dirname(__FILE__), 'misc')
+
+module PuzzleGenerator
+  class ColoredMap
+    include DisplayMap, MapUtils
+    def initialize chained_map, colors = (1..chained_map.option[:colors]).to_a
+      @result_map = []
+      @maps = []
+      @chained_map = chained_map
+      @option = @chained_map.option
+
+      debug_init if PuzzleGenerator.debug
+
+      chained_map.maps.each_with_index{ |map, index|
+        @maps << map.clone_with_map{ |color|
+          color == 0 ? 0 : colors[index % @option[:colors]]
+        }
+      }
+      resolve_map
+      @result_map = if check_no_invoke && strip_answer && check_answer_correctness
+                      put_answer_back; @result_map
+                    else
+                      GenerationFailed.new("ColoredMap: last result_map: #{@result_map.inspect}")
+                    end
+    end
+
+    private
+    def debug_init
+      @debug_answer = @chained_map.maps.last.each_with_index_2d{ |i, x, y| break i if i != 0 }
+    end
+    def check_no_invoke
+      m = Map.new :data => @result_map, :option => @option
+      m.each_with_index_2d{ |i, x, y|
+        return false if check_left_chain( m, x, y) ||
+                        check_right_chain(m, x, y) ||
+                        check_up_chain(   m, x, y) ||
+                        check_down_chain( m, x, y)
+      }
+      true
+    end
+    def strip_answer
+      @x, @y = @chained_map.maps.last.each_with_index_2d{ |i, x, y| break [x, y] if i != 0 }
+      # map = Map.new :data => @result_map, :option => @option
+      # return false unless !check_left_chain( map, @x, @y) &&
+      #                     !check_right_chain(map, @x, @y) &&
+      #                     !check_up_chain(   map, @x, @y) &&
+      #                     !check_down_chain( map, @x, @y)
+      @answer_color = @result_map[@x][@y]
+      @result_map[@x][@y] = 0
+      true
+    end
+    def put_answer_back
+      @result_map[@x][@y] = @debug_answer || @answer_color
+      @x, @y, @answer_color = nil
+    end
+  end
+
+end

data/lib/puzzle_generator/map.rb

@@ -0,0 +1,135 @@
+
+pwd = File.dirname __FILE__
+
+require File.join(pwd, 'misc')
+require File.join(pwd, 'chain')
+
+require 'rubygems'
+
+gem 'ludy', '>=0.0.7'   # for Array#untranspose
+require 'ludy/ludy_ext'
+
+gem 'facets', '>=2.0.0' # for lots of things
+require 'facets'        # for Array#combos
+require 'facets/random' # for Kernel#maybe
+
+# a = [[1,2],[3,4],[5,6]]
+# [a, [1,2,3]].combos
+# => [[[1, 2], 1], [[1, 2], 2], [[1, 2], 3], [[3, 4], 1], [[3, 4], 2], [[3, 4], 3], [[5, 6], 1], [[5, 6], 2], [[5, 6], 3]]
+
+module PuzzleGenerator
+
+  class Map
+    include DisplayMap, Enumerable
+    attr_reader :chains
+    def result_map; @data; end
+    def initialize option = {}
+      @option = DefaultOption.merge option
+      @data = @option[:data] || (Array.new(@option[:width])).map{ [0]*@option[:height] }
+      @chains = @option[:chains] || []
+    end
+    # TRAP!! view is not view, it's clone!!
+    # def [] x, y = (0..-1); @data[x][y]; end
+
+    # NOTICE!! this is not view (reference)
+    def [] x, y = nil
+      if y.nil?
+        @data[x]
+      else
+        if x.kind_of? Range
+          @data[x].transpose[y]
+        else
+          @data[x][y]
+        end
+      end
+    end
+    def []= x, y, v; @data[x][y] = v; end
+    def each_column_with_index; @data.each_with_index{ |column, index| yield column, index }; end
+    def each_column; @data.each{ |column| yield column }; end
+    def clone_with_map
+      Map.new @option.merge(
+        :data => @data.transpose.map{ |row| row.map{ |i| yield i } }.untranspose,
+        :chains => chains
+      )
+    end
+    def to_a; @data.clone; end
+    def each; @data.flatten.each{ |i| yield i }; end
+    def each_with_index_2d
+      @data.transpose.each_with_index{ |row, y| row.each_with_index{ |i, x| yield i, x, y } }
+    end
+    def break_chains map, result_map
+      @temp_map = map
+      @temp_result_map = result_map
+      result = []
+      map.each_column_with_index{ |column, ix|
+        column.each_with_index{ |y, iy| result << [ix, iy] if y != 0 }
+      } # e.g., [[0, 0], [1, 1]]
+      result = transform result,
+        :with_belows,
+        :with_directs,
+        :to_chains,
+        :strip_duplicated_chain,
+        :strip_out_bounded_chain,
+        :strip_overflow_chain,
+        :strip_floating_chain
+
+      @temp_result_map = nil
+      @temp_map = nil
+      result
+    end
+
+    private
+    def transform target, *funs; target = method(funs.shift)[target] until funs.empty?; target; end
+    def with_belows target
+      result = []
+      up_hack = 0 # @temp_map.chains.last.up? ? 1 : 0
+      target.each{ |pos|
+        x, y = pos
+        result.concat( ([x]*(y+1)).zip((up_hack..y).to_a) )
+      }
+      result.uniq
+      # e.g., [[0, 0], [[1, 0], [1, 1]]] =>
+      #       [[0, 0], [1, 0], [1, 1]]
+    end
+    def with_directs target
+      # [target, [Up] + [Right, Left]*10].combos
+      [target, [Up, Right, Left]].combos
+      # e.g., [[[0, 0], Up], [[0, 0], Right], [[0, 0], Left], [[1, 0], Up], ...]
+    end
+    def to_chains target
+      target.map{ |pos| Chain.new pos.first, pos.last, gen_chain_length }
+      # e.g., [Chain#0x000, Chain#0x001, ...]
+    end
+    def gen_chain_length
+      @option[:invoke] + (maybe ? 0 : rand(@option[:invoke_max] - @option[:invoke] + 1))
+    end
+    def strip_duplicated_chain target
+      # target.uniq never works for non-num nor non-string :(
+      # target.sort.inject([]){ |r, i| r.last == i ? r : r<<i }
+      target.uniq_by{|i|i}
+    end
+    def strip_out_bounded_chain target
+      target.select{ |chain| chain.bound_ok? @option[:width], @option[:height] }
+    end
+    def strip_overflow_chain target
+      target.select{ |chain|
+        xs = Hash.new 0
+        chain.to_a.transpose.first.each{ |x| xs[x] += 1 }
+        xs.all?{ |pair|
+          x, count = pair
+          height(@temp_result_map[x]) + count <= @option[:height]
+        }
+      }
+    end
+    def strip_floating_chain target
+      target.select{ |chain|
+        chain.all?{ |pos|
+          x, y = pos # if the direct is up, then it's impossible floating.
+          chain.up? || !@temp_result_map[x][0...y].include?(0)
+        }
+      }
+    end
+    def height column; @option[:height] - column.count(0); end
+  end
+
+end

data/lib/puzzle_generator/misc.rb

@@ -0,0 +1,132 @@
+
+require 'rubygems'
+require 'facets'          # for Array#deep_clone
+# require 'ludy/ludy_ext' # for Kernel#curry
+
+module PuzzleGenerator
+  Up, Right, Left = (0..2).to_a
+  DefaultOption = {:width => 6, :height => 10, :level => 4, :colors => 4,
+                   :invoke => 3, :invoke_max => 5, :timeout => 5}
+  class GenerationFailed < RuntimeError; end
+  class << self
+    attr_writer :debug
+    def debug; @debug || false; end
+  end
+
+  module DisplayMap
+    attr_reader :result_map
+    def display_map
+      result_map.transpose.reverse_each{ |row| puts row.map{ |color| '%2d' % color }.join(' ') }
+    end
+  end
+
+  module MapUtils
+    def make_map_array; (Array.new(@option[:width])).map{ [0]*@option[:height] }; end
+    def resolve_map result_map = @result_map, maps = @maps
+      result_map.replace maps.inject(make_map_array){ |result, map|
+        combine_map result, map
+      }
+    end
+    def combine_map result, map
+      result.zip(map.to_a).map{ |columns|
+        orig, last = columns
+        orig.combine last
+      }
+    end
+    def check_answer_correctness result_map = @result_map
+      map = Map.new @option.merge(:data => result_map.deep_clone)
+      drop_blocks map # because of answer is stripped
+
+      @chained = true
+      while @chained
+        @chained = false
+        destory_chains map
+        drop_blocks    map
+      end
+      @chained = nil
+
+      map.all?{ |i| i == 0 }
+    end
+    def destory_chains map
+      map.each_column_with_index{ |column, x|
+        column.each_with_index{ |value, y|
+          next if value == 0
+
+          left  = check_left_chain  map, x, y
+          right = check_right_chain map, x, y
+          up    = check_up_chain    map, x, y
+          down  = check_down_chain  map, x, y
+
+          # left.fill  0 unless left.nil?
+          # right.fill 0 unless right.nil?
+          # up.fill    0 unless up.nil?
+          # down.fill  0 unless down.nil?
+          left.size.times{ |offset|
+            map[x-offset, y] = 0
+          } unless left.nil?
+          right.size.times{ |offset|
+            map[x+offset, y] = 0
+          } unless right.nil?
+          up.size.times{ |offset|
+            map[x, y+offset] = 0
+          } unless up.nil?
+          down.size.times{ |offset|
+            map[x, y-offset] = 0
+          } unless down.nil?
+
+          @chained ||= left || right || up || down
+        }
+      }
+    end
+    def drop_blocks map
+      map.each_column{ |column| column.map!{ |i| i==0 ? nil : i }.compact!.pad!(@option[:height], 0) }
+    end
+    def check_left_chain map, x, y
+      # this should be rewrited
+      return nil if map[x, y] == 0
+      left = x - @option[:invoke] + 1
+      return nil if left < 0
+      # chain = map[left..x, y]
+      # chain if chain.all?{ |i| i == map[x, y] }
+      # map[0..x, y].inject([]){ |result, value| result << value if value == map[x, y] }
+      do_check_chain map[0..x, y].reverse, map[x, y]
+    end
+    def check_right_chain map, x, y
+      return nil if map[x, y] == 0
+      right = x + @option[:invoke] - 1
+      return nil if right >= @option[:width]
+      # chain = map[x..right, y]
+      # chain if chain.all?{ |i| i == map[x, y] }
+      do_check_chain map[x...@option[:width], y], map[x, y]
+    end
+    def check_up_chain map, x, y
+      return nil if map[x, y] == 0
+      up = y + @option[:invoke] - 1
+      return nil if up >= @option[:height]
+      # chain = map[x, y..up]
+      # chain if chain.all?{ |i| i == map[x, y] }
+      do_check_chain map[x, y...@option[:height]], map[x, y]
+    end
+    def check_down_chain map, x, y
+      return nil if map[x, y] == 0
+      down = y - @option[:invoke] - 1
+      return nil if down < 0
+      # chain = map[x, down..y]
+      # chain if chain.all?{ |i| i == map[x, y] }
+      do_check_chain map[x, 0..y].reverse, map[x, y]
+    end
+    # def check_chain target_color, result, value; result << value if value == target_color; end
+    def do_check_chain target, target_color
+      # target.inject([], &method(:check_chain).curry[target_color])
+      chain = target.inject([]){ |result, value|
+        if value == target_color
+          result << value
+        else
+          break result
+        end
+      }
+      chain.size >= @option[:invoke] ? chain : nil
+    end
+  end
+
+end

data/lib/puzzle_generator/puzzle.rb

@@ -0,0 +1,64 @@
+
+require File.join(File.dirname(__FILE__), 'misc')
+require File.join(File.dirname(__FILE__), 'chained_map')
+require File.join(File.dirname(__FILE__), 'colored_map')
+
+require 'rubygems'
+require 'facets'       # for Array#rotate
+require 'facets/timer'
+
+module PuzzleGenerator
+
+  class Puzzle
+    include DisplayMap
+    attr_reader :tried_times, :tried_duration
+    def initialize option = {}
+      @option = DefaultOption.merge option
+      @tried_times, @tried_duration = [0, 0], [0, 0]
+    end
+    def generate
+      raw_colors = (1..@option[:colors]).to_a
+      step_colors = raw_colors.rotate
+
+      make_chain
+      make_color raw_colors
+      until @result_color.result_map.kind_of? Array
+        if step_colors == raw_colors
+          make_chain
+          make_color raw_colors
+          step_colors = raw_colors.rotate
+        else
+          make_color step_colors
+          step_colors.rotate!
+        end
+      end
+
+      @result_map = @result_color.result_map
+    end
+
+    private
+    Chain, Color = 0, 1
+    def make_chain
+      begin
+        @result_chain =
+          PuzzleGenerator::generate(
+            @option[:timeout] - @tried_duration[Chain]){ ChainedMap.new @option }
+      ensure
+        update_info Chain, LastTriedInfo
+      end
+    end
+    def make_color colors
+      start = Time.now
+      begin
+        @result_color = ColoredMap.new @result_chain, colors
+      ensure
+        update_info Color, {:tried_times => 1, :tried_duration => Time.now - start}
+      end
+    end
+    def update_info index, info
+      @tried_times[index]    += info[:tried_times]
+      @tried_duration[index] += info[:tried_duration]
+    end
+  end
+
+end

data/lib/puzzle_generator.rb

@@ -0,0 +1,35 @@
+
+# alpha at 2007.10.14
+
+require File.join(File.dirname(__FILE__), 'puzzle_generator', 'puzzle')
+
+require 'rubygems'
+require 'facets'   # for Hash#reverse_merge
+require 'facets/timer'
+
+module PuzzleGenerator
+
+  def self.generate_chained_map option = {}; generate_klass ChainedMap, option; end
+  def self.generate_klass klass, option = {}
+    option.reverse_merge! :timeout => 5
+    generate(option[:timeout]){ klass.new option }
+  end
+
+  LastTriedInfo = {}
+  def self.generate timeout = 5, &generator
+    timer = Timer.new(timeout).start
+    tried_times = 1
+    begin
+      result = generator.call
+      until result.result_map.kind_of? Array
+        tried_times += 1
+        result = generator.call
+      end
+    ensure
+      timer.stop
+      LastTriedInfo.merge! :tried_times => tried_times, :tried_duration => timer.total_time
+    end
+    result
+  end
+
+end

data/ludy.gemspec

@@ -18,7 +18,7 @@ require 'rubygems'
 
 spec = Gem::Specification.new{|s|
   s.name     = 'ludy'
-  s.version  = '0.0.7'
+  s.version  = '0.0.8'
   s.author   = 'Lin Jen-Shin(a.k.a. godfat)'
   s.email    = 'strip number: 135godfat7911@246godfat.890org'
   s.homepage = 'http://ludy.rubyforge.org/'

data/test/tc_ludy_ext.rb

@@ -76,6 +76,12 @@ class TestLudyExt < Test::Unit::TestCase
     assert_equal (0..4).to_a, lambda{|a,b,c,d,e|[a,b,c,d,e]}.curry[0][1][2][3][4]
   end
 
+  def test_symbol_curry
+    a = [1,2,3]
+    assert_equal nil, a.find(&:==.curry[0])
+    assert_equal 2, a.find(&:==.curry[2])
+  end
+
   def test_proc_chain
     f1 = lambda{|v| v+1}
     assert_equal 5, f1[4]

data/test/test_puzzle.rb

@@ -0,0 +1,177 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'puzzle_generator')
+
+PuzzleGenerator.debug = true
+p = PuzzleGenerator::Puzzle.new :level => 15, :timeout => 600, :invoke_max => 5
+begin
+  p.generate
+  p.display_map
+rescue Timeout::Error
+  puts 'Timeout!!'
+ensure
+  p p.tried_times
+  p p.tried_duration
+end
+
+# level => 7
+# 0  0  0  0  0  0
+# 0  0  0  0  0  0
+# 0  0  3  0  0  0
+# 0  0  1  0  0  0
+# 1  3  4  0  0  0
+# 2  1  1  0  0  0
+# 2  3  2  0  0  0
+# 3  4  3  0  0  0
+# 3  1  2  4  0  0
+# 2  4  2  1  0  0
+
+# level => 15
+# 0  0  1  0  0  0
+# 2  0  2  1  0  0
+# 1  0  4  1  0  0
+# 2  0  3  3  1  0
+# 2  4  1  4  4  0
+# 3  2  4  2  2  1
+# 4  1  1  3  3  2
+# 3  3  2  3  4  3
+# 3  1  3  4  1  2
+# 2  3  4  1  4  2
+
+# level => 7
+#  0  0  0  0  0  0
+#  0  0  0  0  0  0
+#  0  0  0  0  0  0
+#  0  0  0  0  0  0
+#  0  0  1  0  0  0
+#  0  0  2  2  0  0
+#  0  1  3  4  4  0
+#  1  2  4  1  1  0
+#  3  3  2  2  3  1
+#  2  2  3  3  4  3
+# [20, 9]
+# [1.630587, 0.151272]
+
+# level => 10
+#  0  0  1  1  0  0
+#  0  0  1  2  0  0
+#  0  0  2  3  0  0
+#  0  0  2  3  0  0
+#  0  0  3  4  0  0
+#  0  1  4  1  0  0
+#  0  2  1  3  4  0
+#  2  2  2  2  1  0
+#  2  3  1  3  2  4
+#  4  4  1  4  3  2
+# [28, 1]
+# [3.26917, 0.020366]
+
+# level => 12
+#  0  2  1  0  0  0
+#  0  2  2  0  0  0
+#  0  3  3  1  0  0
+#  0  4  3  2  0  0
+#  0  4  4  2  0  4
+#  0  1  4  3  1  1
+#  0  4  1  1  2  1
+#  0  3  2  2  1  2
+#  0  3  4  4  3  1
+#  2  3  4  3  4  1
+# [68, 1]
+# [6.194671, 0.055699]
+
+# level => 13
+#  0  3  1  0  0  0
+#  0  2  1  1  0  0
+#  0  3  3  2  1  2
+#  0  3  2  1  1  4
+#  0  4  2  3  3  4
+#  0  1  3  3  2  1
+#  0  4  2  4  3  1
+#  0  4  2  1  4  2
+#  0  3  1  4  4  1
+#  2  3  2  2  1  1
+# [10, 1]
+# [1.97002, 0.030499]
+
+# level => 7
+#  0  0  0  0  0  0
+#  0  0  0  2  0  0
+#  0  0  0  3  0  0
+#  0  0  0  4  0  0
+#  0  0  0  1  0  0
+#  0  0  0  2  0  0
+#  0  1  1  3  0  0
+#  0  2  2  4  3  0
+#  0  4  4  3  4  3
+#  1  2  2  3  1  1
+# [53, 17]
+# [4.614123, 0.264156]
+
+# level => 14
+#  0  0  0  0  0  0
+#  0  0  1  0  0  0
+#  1  0  4  0  2  0
+#  1  0  2  4  3  0
+#  2  1  3  2  3  0
+#  2  3  1  4  4  1
+#  3  1  4  3  3  2
+#  2  4  1  4  3  2
+#  3  2  2  1  1  3
+#  2  4  4  1  1  2
+# [123, 1]
+# [14.940386, 0.077763]
+
+# level => 15
+#  0  0  0  0  1  0
+#  0  0  2  0  2  0
+#  0  0  1  0  3  0
+#  0  4  4  1  4  1
+#  2  2  4  2  3  3
+#  3  2  2  3  1  1
+#  3  3  1  4  4  2
+#  4  3  1  3  4  2
+#  2  4  2  1  1  3
+#  3  3  1  1  4  2
+# [3650, 17]
+# [464.755704, 1.220837]
+
+# level => 15
+# 0  2  0  0  1  0
+# 0  4  2  1  3  0
+# 4  3  3  2  2  0
+# 2  4  3  3  2  0
+# 1  2  2  3  3  0
+# 1  1  4  2  3  0
+# 2  1  3  4 16  0
+# 1  2  2  1  3  1
+# 4  1  4  4  2  3
+# 1  1  3  4  1  1
+# [1626, 1]
+# [159.004594, 0.035997]
+
+# level => 17 => broken...
+# 0  2  0  1  1  0
+# 0  4  2  2  3  0
+# 4 <3  3  3> 2  1
+# 2  4  3  3  2  2
+# 1  2  2  2  3  3
+# 1  1  4  4  3  2
+# 2  1  3  1  1  2
+# 1  2  2  1  3  1
+# 4  1  4  4  2  3
+# 1  1  3  4  1  1
+# hacked from above XD
+
+# level => 15
+#  1  0  0  0  0  0
+#  3  1  1  0  3  0
+#  4  2  4  4  1  0
+#  4  3  2  2  4  0
+#  1  3  2  3  2  0
+#  1  2  3  1  2  0
+#  2  4  2  4  3  0
+#  1  3  3  2  3  0
+#  1  3  1  1 16  4
+#  4  1  2  2  3  1
+# [1139, 1]
+# [115.270095, 0.031929]

metadata

@@ -1,33 +1,26 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.4
-specification_version: 1
 name: ludy
 version: !ruby/object:Gem::Version 
-  version: 0.0.7
-date: 2007-10-08 00:00:00 +08:00
-summary: Aims to extend Ruby standard library, providing some useful tools that's not existed in the standard library.
-require_paths: 
-- lib
-email: "strip number: 135godfat7911@246godfat.890org"
-homepage: http://ludy.rubyforge.org/
-rubyforge_project: 
-description: 
-autorequire: ludy
-default_executable: 
-bindir: bin
-has_rdoc: false
-required_ruby_version: !ruby/object:Gem::Version::Requirement 
-  requirements: 
-  - - ">"
-    - !ruby/object:Gem::Version 
-      version: 0.0.0
-  version: 
+  version: 0.0.8
 platform: ruby
-signing_key: 
-cert_chain: 
-post_install_message: 
 authors: 
 - Lin Jen-Shin(a.k.a. godfat)
+autorequire: ludy
+bindir: bin
+cert_chain: []
+
+date: 2007-12-06 00:00:00 +08:00
+default_executable: 
+dependencies: []
+
+description: 
+email: "strip number: 135godfat7911@246godfat.890org"
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
 files: 
 - lib/lib
 - lib/lib/amulti.rb
@@ -46,6 +39,14 @@ files:
 - lib/ludy/y_combinator.rb
 - lib/ludy/z_combinator.rb
 - lib/ludy.rb
+- lib/puzzle_generator
+- lib/puzzle_generator/chain.rb
+- lib/puzzle_generator/chained_map.rb
+- lib/puzzle_generator/colored_map.rb
+- lib/puzzle_generator/map.rb
+- lib/puzzle_generator/misc.rb
+- lib/puzzle_generator/puzzle.rb
+- lib/puzzle_generator.rb
 - test/tc_callstack.rb
 - test/tc_curry.rb
 - test/tc_dice.rb
@@ -56,6 +57,7 @@ files:
 - test/tc_variable.rb
 - test/tc_y_combinator.rb
 - test/tc_z_combinator.rb
+- test/test_puzzle.rb
 - test/ts_ludy.rb
 - CHANGES
 - lib
@@ -64,17 +66,31 @@ files:
 - NOTICE
 - README
 - test
-test_files: 
-- test/ts_ludy.rb
+has_rdoc: false
+homepage: http://ludy.rubyforge.org/
+post_install_message: 
 rdoc_options: []
 
-extra_rdoc_files: []
-
-executables: []
-
-extensions: []
-
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
 requirements: []
 
-dependencies: []
-
+rubyforge_project: 
+rubygems_version: 0.9.5
+signing_key: 
+specification_version: 2
+summary: Aims to extend Ruby standard library, providing some useful tools that's not existed in the standard library.
+test_files: 
+- test/ts_ludy.rb