binary_puzzle_solver 0.0.1

data/test/parse-board.rb

@@ -0,0 +1,582 @@
+# Copyright (c) 2012 Shlomi Fish
+#
+# 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.
+#
+# ----------------------------------------------------------------------------
+#
+# This is the MIT/X11 Licence. For more information see:
+#
+# 1. http://www.opensource.org/licenses/mit-license.php
+#
+# 2. http://en.wikipedia.org/wiki/MIT_License
+
+require "binary_puzzle_solver.rb"
+require "rspec"
+require "pry"
+
+class Object
+    def ok()
+        self.should == true
+    end
+    def not_ok()
+        self.should == false
+    end
+end
+
+def compare_boards(got, expected)
+    got.max_idx(:x).should == expected.max_idx(:x)
+    got.max_idx(:y).should == expected.max_idx(:y)
+
+    (0 .. got.max_idx(:y)).each do |y|
+        (0 .. got.max_idx(:x)).each do |x|
+            coord = Binary_Puzzle_Solver::Coord.new(:x => x, :y => y)
+            begin
+            got.get_cell_state(coord).should == expected.get_cell_state(coord)
+            rescue
+                puts "Wrong coord in x=#{x} y=#{y}"
+                puts "Got == #{got.as_string()}"
+                puts "Expected == #{expected.as_string()}"
+                raise
+            end
+        end
+    end
+
+    return
+end
+
+def get_6x6_easy_board_1()
+    input_str = <<'EOF'
+|1  0  |
+|  00 1|
+| 00  1|
+|      |
+|00 1  |
+| 1  00|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_easy_board_1__intermediate_board()
+    str = <<'EOF'
+|101010|
+|010011|
+|100101|
+|011010|
+|001101|
+|110100|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(str)
+end
+
+def get_6x6_easy_board_2()
+    input_str = <<'EOF'
+|  0  1|
+|1 00  |
+| 1    |
+|    1 |
+|  1  0|
+|00 1  |
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_easy_board_2__intermediate_board()
+    input_str = <<'EOF'
+|100101|
+|110010|
+|011001|
+|100110|
+|011010|
+|001101|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_medium_board_1()
+    input_str = <<'EOF'
+|    00|
+|      |
+| 1    |
+|01 1  |
+|0   0 |
+|  1   |
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_medium_board_1__after_easy_moves()
+    input_str = <<'EOF'
+|   100|
+| 01   |
+|110   |
+|0101  |
+|001 0 |
+|101   |
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_medium_board_1__after_cells_of_one_value_in_row_were_all_found()
+    input_str = <<'EOF'
+|110100|
+|001011|
+|1100  |
+|0101  |
+|001101|
+|1010  |
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_6x6_medium_board_1__final()
+    input_str = <<'EOF'
+|110100|
+|001011|
+|110010|
+|010101|
+|001101|
+|101010|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_8x8_easy_board_1__initial()
+    input_str = <<'EOF'
+|       0|
+| 00  1  |
+| 0   1 0|
+|  1     |
+|00 1  1 |
+|    1   |
+|11   0 1|
+| 1     1|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_8x8_easy_board_1__final()
+    input_str = <<'EOF'
+|01101010|
+|10010101|
+|10010110|
+|01101001|
+|00110110|
+|10011010|
+|11001001|
+|01100101|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_8x8_medium_board_1__initial()
+    input_str = <<'EOF'
+|    0 0 |
+|0 0 0 0 |
+|        |
+|    1 1 |
+|0  0    |
+|0  00   |
+|       1|
+| 1 1    |
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+def get_8x8_medium_board_1__final()
+    input_str = <<'EOF'
+|10100101|
+|01010101|
+|10101010|
+|10011010|
+|01100101|
+|01100110|
+|10011001|
+|01011010|
+EOF
+    return Binary_Puzzle_Solver.gen_board_from_string_v1(input_str)
+end
+
+describe "construct_board" do
+    it "6*6 Easy board No. 1 should" do
+
+        board = get_6x6_easy_board_1()
+
+        ONE = Binary_Puzzle_Solver::Cell::ONE
+        ZERO = Binary_Puzzle_Solver::Cell::ZERO
+        UNKNOWN = Binary_Puzzle_Solver::Cell::UNKNOWN
+
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 0, :y => 0)
+        ).should == ONE
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 3, :y => 0)
+        ).should == ZERO
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 1, :y => 0)
+        ).should == UNKNOWN
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 2, :y => 1)
+        ).should == ZERO
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 5, :y => 1)
+        ).should == ONE
+
+        # Check for dimensions of the board.
+        board.limit(:y).should == 6
+        board.limit(:x).should == 6
+        board.max_idx(:y).should == 5
+        board.max_idx(:x).should == 5
+
+        view = board.get_view(:rotate => false)
+
+        view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 0, :y => 0)
+        ).should == ONE
+        view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 3, :y => 0)
+        ).should == ZERO
+        view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 1, :y => 0)
+        ).should == UNKNOWN
+        view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 2, :y => 1)
+        ).should == ZERO
+        view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 5, :y => 1)
+        ).should == ONE
+
+        view.get_row_summary(:dim => :x, :idx => 3
+        ).get_count(ONE).should == 1
+        view.get_row_summary(:dim => :x, :idx => 3
+        ).get_count(ZERO).should == 2
+        view.get_row_summary(:dim => :x, :idx => 0
+        ).get_count(ONE).should == 1
+        view.get_row_summary(:dim => :x, :idx => 0
+        ).get_count(ZERO).should == 1
+        view.get_row_summary(:dim => :y, :idx => 1
+        ).get_count(ZERO).should == 2
+        view.get_row_summary(:dim => :y, :idx => 1
+        ).get_count(ONE).should == 1
+
+        # Check for dimensions of the view.
+        view.limit(:y).should == 6
+        view.limit(:x).should == 6
+        view.max_idx(:y).should == 5
+        view.max_idx(:x).should == 5
+
+        rotated_view = board.get_view(:rotate => true)
+
+        rotated_view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:y => 0, :x => 0)
+        ).should == ONE
+        rotated_view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:y => 3, :x => 0)
+        ).should == ZERO
+        rotated_view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:y => 1, :x => 0)
+        ).should == UNKNOWN
+        rotated_view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:y => 2, :x => 1)
+        ).should == ZERO
+        rotated_view.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:y => 5, :x => 1)
+        ).should == ONE
+
+        # Check for dimensions of the rotated_view.
+        rotated_view.limit(:y).should == 6
+        rotated_view.limit(:x).should == 6
+        rotated_view.max_idx(:y).should == 5
+        rotated_view.max_idx(:x).should == 5
+
+    end
+end
+
+describe "rudimentary_deduction" do
+    it "6*6 Easy board No. 1 should" do
+
+        board = get_6x6_easy_board_1()
+
+        # ONE = Binary_Puzzle_Solver::Cell::ONE
+        # ZERO = Binary_Puzzle_Solver::Cell::ZERO
+        # UNKNOWN = Binary_Puzzle_Solver::Cell::UNKNOWN
+
+        view = board.get_view(:rotate => false)
+        view.check_and_handle_sequences_in_row(:idx => 1)
+
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 1, :y => 1)
+        ).should == ONE
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 4, :y => 1)
+        ).should == ONE
+
+        board.num_moves_done.should == 2
+
+    end
+
+    it "6*6 Easy board No. 1 should" do
+
+        board = get_6x6_easy_board_1()
+
+        view = board.get_view(:rotate => true)
+        view.check_and_handle_sequences_in_row(:idx => 5)
+
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 5, :y => 0)
+        ).should == ZERO
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 5, :y => 3)
+        ).should == ZERO
+
+        board.num_moves_done.should == 2
+
+    end
+
+    it "6*6 Easy board No. 1 should flush moves properly" do
+
+        board = get_6x6_easy_board_1()
+
+        # ONE = Binary_Puzzle_Solver::Cell::ONE
+        # ZERO = Binary_Puzzle_Solver::Cell::ZERO
+        # UNKNOWN = Binary_Puzzle_Solver::Cell::UNKNOWN
+
+        view = board.get_view(:rotate => false)
+        view.check_and_handle_sequences_in_row(:idx => 1)
+
+        board.flush_moves()
+
+        view = board.get_view(:rotate => true)
+        view.check_and_handle_sequences_in_row(:idx => 5)
+
+        # Checking that the moves were flushed.
+        board.num_moves_done.should == 2
+
+    end
+
+    it "6*6 Easy board No. 1 should" do
+
+        board = get_6x6_easy_board_1()
+
+        # ONE = Binary_Puzzle_Solver::Cell::ONE
+        # ZERO = Binary_Puzzle_Solver::Cell::ZERO
+        # UNKNOWN = Binary_Puzzle_Solver::Cell::UNKNOWN
+
+        view = board.get_view(:rotate => false)
+        view.check_and_handle_sequences_in_row(:idx => 1)
+
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 1, :y => 1)
+        ).should == ONE
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 4, :y => 1)
+        ).should == ONE
+
+        board.num_moves_done.should == 2
+
+        m = board.get_new_move(0)
+
+        # Move has (x=1,y=1) coordinate.
+        m.coord.x.should == 1
+        m.coord.y.should == 1
+        m.dir.should == :x
+        m.val.should == ONE
+
+        m = board.get_new_move(1)
+
+        # Move has (x=1,y=1) coordinate.
+        m.coord.x.should == 4
+        m.coord.y.should == 1
+        m.dir.should == :x
+        m.val.should == ONE
+
+    end
+
+    it "6*6 Easy board No. 1 should" do
+
+        board = get_6x6_easy_board_1()
+
+        # ONE = Binary_Puzzle_Solver::Cell::ONE
+        # ZERO = Binary_Puzzle_Solver::Cell::ZERO
+        # UNKNOWN = Binary_Puzzle_Solver::Cell::UNKNOWN
+
+        view = board.get_view(:rotate => true)
+        view.check_and_handle_known_unknown_sameknown_in_row(:idx => 1)
+
+        board.get_cell_state(
+            Binary_Puzzle_Solver::Coord.new(:x => 1, :y => 3)
+        ).should == ONE
+
+        board.num_moves_done.should == 1
+
+        m = board.get_new_move(0)
+
+        # Move has (x=1,y=1) coordinate.
+        m.coord.x.should == 1
+        m.coord.y.should == 3
+        m.dir.should == :y
+        m.val.should == ONE
+
+    end
+
+    it "6*6 Easy process should" do
+
+        board = get_6x6_easy_board_1()
+
+        board.add_to_iters_quota(1_000_000_000);
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+            ]
+        );
+
+        good_num_iters = board.num_iters_done()
+
+        final_board = get_6x6_easy_board_1__intermediate_board()
+
+        compare_boards(board, final_board)
+
+        resume_board = get_6x6_easy_board_1()
+
+        resume_board.add_to_iters_quota(10);
+
+        resume_board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+            ]
+        );
+
+        resume_board.add_to_iters_quota(1_000_000_000)
+
+        resume_board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+            ]
+        );
+
+        resume_board.num_iters_done.should == good_num_iters
+    end
+
+    it "Solving 6*6 Easy board No. 2 should" do
+
+        board = get_6x6_easy_board_2()
+
+        board.add_to_iters_quota(1_000_000_000);
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+            ]
+        );
+
+        final_board = get_6x6_easy_board_2__intermediate_board()
+
+        compare_boards(board, final_board)
+    end
+
+    it "Solving 6*6 Medium board No. 1 should" do
+
+        board = get_6x6_medium_board_1()
+
+        board.validate().should == :non_final
+
+        board.add_to_iters_quota(1_000_000_000);
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+            ]
+        );
+
+        first_intermediate_board = get_6x6_medium_board_1__after_easy_moves()
+
+        compare_boards(board, first_intermediate_board)
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_cells_of_one_value_in_row_were_all_found,
+            ]
+        )
+
+        second_intermediate_board = get_6x6_medium_board_1__after_cells_of_one_value_in_row_were_all_found()
+
+        compare_boards(board, second_intermediate_board)
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+                :check_and_handle_cells_of_one_value_in_row_were_all_found,
+            ]
+        )
+
+        final_board = get_6x6_medium_board_1__final()
+
+        compare_boards(board, final_board)
+
+        board.validate().should == :final
+    end
+
+    it "Solving 8*8 Easy board No. 1 should" do
+
+        board = get_8x8_easy_board_1__initial()
+
+        board.add_to_iters_quota(1_000_000_000);
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+                :check_and_handle_cells_of_one_value_in_row_were_all_found,
+            ]
+        );
+
+        final_board = get_8x8_easy_board_1__final()
+
+        compare_boards(board, final_board)
+    end
+
+    it "Solving 8*8 Medium board No. 1 should" do
+
+        board = get_8x8_medium_board_1__initial()
+
+        board.add_to_iters_quota(1_000_000_000);
+
+        board.try_to_solve_using(
+            :methods => [
+                :check_and_handle_sequences_in_row,
+                :check_and_handle_known_unknown_sameknown_in_row,
+                :check_and_handle_cells_of_one_value_in_row_were_all_found,
+            ]
+        );
+
+        final_board = get_8x8_medium_board_1__final()
+
+        # binding.pry
+        compare_boards(board, final_board)
+    end
+end

metadata

@@ -0,0 +1,90 @@
+--- !ruby/object:Gem::Specification
+name: binary_puzzle_solver
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Shlomi Fish
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-11-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: launchy
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 2.5.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 2.5.0
+description: ! "This is a solver for instances of the so-called Binary\n      Puzzle
+  from http://www.binarypuzzle.com/ . It is incomplete, but\n      can still solve
+  some games\n    "
+email:
+- shlomif@cpan.org
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Gemfile
+- LICENSE.txt
+- Makefile
+- README.md
+- Rakefile
+- binary_puzzle_solver.gemspec
+- lib/binary_puzzle_solver.rb
+- lib/binary_puzzle_solver/base.rb
+- lib/binary_puzzle_solver/version.rb
+- test/parse-board.rb
+homepage: http://github.com/shlomif/binary-puzzle-garden
+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: A solver for http://www.binarypuzzle.com/ instances
+test_files:
+- test/parse-board.rb