Algorithmically 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c91ca3b58d7d092993dc20a3f8ecf2434f34fd45
-  data.tar.gz: e3506c96aa0aae8e90cd47c463430bd0cbf2111a
+  metadata.gz: 7a20a235b28515eea9f3bc92defec55d22d6729d
+  data.tar.gz: 5d21f847f53c63d35c3418e2b0f66c84486494b1
 SHA512:
-  metadata.gz: 3a9feda8f6f49348e02129966da3e153ba96134ea893415ceaa18623e8b84baf750fa26e81c9f1e6a23b2ac704f63a39a905f5772fb6ea66ccdd785ba28d1fa5
-  data.tar.gz: f9ee9e53fe0449c5f32686fd751cc1f0ea47b84e82c96bdad03daf741497c47f02b3bf3d3c9d7eb3d21e592c9a09b2f91cf561909b91493da63dbcdcea407a46
+  metadata.gz: 875e6766cd3c27056098131cd6ddd7bf997a36df96ef8cbb6c5ce7bcb1f4327cfe3c91441d0e0f9cdfda4b6a4b88c17c9b1a45e063eeefc5589018ae446b93f1
+  data.tar.gz: 93adaaae0738b14f82936259b788c3b89d95875bd6745704f35ca640957f95da2919991c7e3c9bdb2e4356d9f123a70426b12b16da25f52264c1c0e24055a7f9

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    Algorithmically (0.1.1)
+    Algorithmically (0.1.2)
 
 GEM
   remote: https://rubygems.org/

data/README.md

@@ -17,4 +17,13 @@ And then execute:
 Or install it yourself as:
 
     $ gem install Algorithmically
+    
+## Usage
+
+### Stochastic Algorithms
+    
+    Algorithmically::RandomSearch.new(2, 50)
+
+    Algorithmically::AdaptiveRandomSearch.new(1000, 2, 0.05, 1.3, 3.0, 10, 30)
+
 

data/lib/Algorithmically.rb

@@ -1,6 +1,7 @@
 require 'Algorithmically/version'
 require 'Algorithmically/Stochastic/random_search'
-require 'Algorithmically/Stochastic/adaptive_random_search'
+require 'Algorithmically/Stochastic/hill_climbing'
+
 
 module Algorithmically
   include Stochastic

data/lib/Algorithmically/Stochastic/hill_climbing.rb

@@ -0,0 +1,42 @@
+module Stochastic
+
+  class HillClimbing
+
+    def initialize(max_iterations, num_bits)
+      best = search(max_iterations, num_bits)
+      puts "Done. Best Solution: c=#{best[:cost]}, v=#{best[:vector].join}"
+    end
+
+    def onemax(vector)
+      vector.inject(0.0) { |sum, v| sum + ((v=="1") ? 1 : 0) }
+    end
+
+    def random_bitstring(num_bits)
+      Array.new(num_bits) { |i| (rand<0.5) ? "1" : "0" }
+    end
+
+    def random_neighbor(bitstring)
+      mutant = Array.new(bitstring)
+      pos = rand(bitstring.size)
+      mutant[pos] = (mutant[pos]=='1') ? '0' : '1'
+      mutant
+    end
+
+    def search(max_iterations, num_bits)
+      candidate = {}
+      candidate[:vector] = random_bitstring(num_bits)
+      candidate[:cost] = onemax(candidate[:vector])
+      max_iterations.times do |iter|
+        neighbor = {}
+        neighbor[:vector] = random_neighbor(candidate[:vector])
+        neighbor[:cost] = onemax(neighbor[:vector])
+        candidate = neighbor if neighbor[:cost] >= candidate[:cost]
+        puts " > iteration #{(iter+1)}, best=#{candidate[:cost]}"
+        break if candidate[:cost] == num_bits
+      end
+      candidate
+    end
+
+  end
+
+end

data/lib/Algorithmically/version.rb

@@ -1,3 +1,3 @@
 module Algorithmically
-  VERSION = '0.1.1'
+  VERSION = '0.1.2'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: Algorithmically
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.2
 platform: ruby
 authors:
 - popac
@@ -77,6 +77,7 @@ files:
 - bin/setup
 - lib/Algorithmically.rb
 - lib/Algorithmically/Stochastic/adaptive_random_search.rb
+- lib/Algorithmically/Stochastic/hill_climbing.rb
 - lib/Algorithmically/Stochastic/random_search.rb
 - lib/Algorithmically/version.rb
 homepage: https://github.com/popac/Algorithmically