mgmg 1.3.0 → 1.3.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 48ad2b791e601abcf8108fcfceabed64d97b5beeb949e3b409fcb0ef7de148ed
-  data.tar.gz: 2154c226324c09f202a660bef0b344c3ee57a792dc14e889a9caedb79e5adfb8
+  metadata.gz: 5ae250ef7035838c1f0598c419e66259c1cde7ab692e5b5ffefcd78ab845207d
+  data.tar.gz: 0fd5f62e8c3ac85ba990010bca631e08111b50d69fad11d782fcadfe075781fd
 SHA512:
-  metadata.gz: a40d7b79dd7666a8fc1aa3985bd79f074d80f26ddd28b3c92cdef826edb28406154f3151fe1de5583a4ec3139d6710f71390f7fa60e1c896f2d9452f3dd00b70
-  data.tar.gz: cf7c8fe93611cad843f0bca7da77f02c24fbe5f7c2b932741f8ce94c80b73df1f355501521b6aabad99a17670d1649f5c7637721974bd096b6eb70726825d0b7
+  metadata.gz: 40bdd74efb69a024d87d265340caefd48ee90f4d3fd9d74d2a7a46fd78c6a553bc931798636b1ebc8bed8e95cfa8c6501a554c073897ac0ae9be3fdd37298466
+  data.tar.gz: 9c32dfaf9a0d1027afd33e70562e813f7cce5a0378e0e81f806e77e3d4415ee4d779a09b7d3b122d523d9a0f8cc10af1a97da0ee3e3464440777b82efee35c48

data/CHANGELOG.md

@@ -87,3 +87,9 @@
 - `String#poly`のデフォルト引数を`:cost`に設定．
 - `Mgmg.#exp`，`String#eff`，`String#peff`，`String#min_levels`を追加．
 - `String#smith_search`, `String#comp_search`, `String#min_smith`, `String#min_comp`を追加．
+
+## 1.3.1 2020/08/31
+- `String#poly`のキーワード引数`left_associative`が無視される場合があったバグを修正．
+- `Mgmg.#exp`に3引数を与えられるように修正．
+- `String#search`，`Enumerable#search`を追加．
+- `Enumerable#min_levels`，`Enumerable#min_level`，`Enumerable#min_smith`，`Enumerable#min_comp`を追加．

data/README.md

@@ -110,12 +110,23 @@ puts '小竜咆哮'.build
 合成レシピの各鍛冶・防具製作品に対して，レシピ文字列をキー，重量1で作製するために必要な製作Lvを値とした`Hash`を返します．重量1以外は指定できません．
 最大値は，`self.build.min_level`によって得られます．
 
-### `String#min_comp(left_associative: true)`
+### `Enumerable#min_levels(left_associative: true)`
+すべての要素`str`に対する`str.min_levels`をマージした`Hash`を返します．
+
+### `Enumerable#min_level(left_associative: true)`
+`self.min_levels`から武器，防具それぞれに対する最大値を求め，`[必要最小鍛冶Lv, 必要最小防具製作Lv]`を返します．武器，防具の一方のみが含まれる場合，もう一方は`0`になります．
+`String#min_level`と異なり，重量1以外は指定できません．
+
+### `String#min_comp(left_associative: true)`，`Enumerable#min_comp(left_associative: true)`
 レシピ通りに合成するのに必要な道具製作Lvを返します．ただし，全体が「[]」で囲われているか，非合成レシピの場合，代わりに`0`を返します．
 
-### `String#min_smith(left_associative: true)`
+`Enumerable`の場合，すべての要素に対する最大値を返します．
+
+### `String#min_smith(left_associative: true)`，`Enumerable#min_smith(left_associative: true)`
 レシピ通りに製作するのに必要な鍛冶・防具製作Lvを返します．製作物の重量については考慮せず，鍛冶・防具製作に必要な☆条件を満たすために必要な製作Lvを返します．
 
+`Enumerable`の場合，すべての要素に対し，武器，防具それぞれの最大値を求め，`[必要最小鍛冶Lv, 必要最小防具製作Lv]`を返します．
+
 ### `String#poly(para=:cost, left_associative: true)`
 レシピ文字列である`self`を解釈し，`para`で指定した9パラ値について，丸めを無視した鍛冶・防具製作Lvと道具製作Lvの2変数からなる多項式関数を示す`Mgmg::TPolynomial`クラスのインスタンスを生成し，返します．`para`は次のシンボルのいずれかを指定します．
 ```ruby
@@ -131,20 +142,31 @@ puts '小竜咆哮'.build
 
 また，`:cost`を渡すことで，消費エレメント量に関する近似多項式を得られます．`self`に`"+"`が含まれていれば合成品とみなし，最後の合成に必要な地エレメント量を，それ以外では，武器なら消費火エレメント量を，防具なら消費水エレメント量を返します．ただし，`self`が既成品そのものの場合，零多項式を返します．
 
-### `String#smith_seach(para, target, comp, smith_min=nil, smith_max=10000, left_associative: true)`
+### `String#smith_seach(para, target, comp, smith_min=nil, smith_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)`
 `para`の値が`target`以上となるのに必要な最小の鍛冶・防具製作Lvを二分探索で探索して返します．
 道具製作Lvは`comp`で固定，鍛冶・防具製作Lvを`smith_min`と`smith_max`で挟み込んで探索します．
-`smith_min`が`nil`のとき，最小重量で製作するのに必要な鍛冶・防具製作Lv (`self.build.min_level`)を使用します．
-重量を無視して，製作に必要な最小Lvである`self.min_smith`まで探索したい場合，明示的に指定します．
+`smith_min`が`nil`のとき，`min_smith`が真なら重量を問わず☆的に必要な最小の鍛冶・防具製作Lv (`self.min_smith`)，偽なら最小重量で製作するのに必要な鍛冶・防具製作Lv (`self.build.min_level`)を使用します．
 `smith_min<smith_max`でないとき，`smith_max`で`para`が`target`以上でないときは`ArgumentError`となります．
 `para`は，`Mgmg::Equip`のメソッド名をシンボルで指定(`:power, :fpower`も可)します．
 反転などの影響で，探索範囲において`para`の値が(広義)単調増加になっていない場合，正しい結果を返しません．
+`cut_exp`以下の経験値で`target`以上を達成できない場合，`Mgmg::SearchCutException`を発生します．
 
 ### `String#comp_search(para, target, smith, comp_min=nil, comp_max=10000, left_associative: true)`
 `String#smith_seach`とは逆に，鍛冶・防具製作Lvを固定して最小の道具製作Lvを探索します．
 `comp_min`が`nil`のときは，製作に必要な最小の道具製作Lv (`self.min_comp`)を使用します．
 その他は`String#smith_seach`と同様です．
 
+### `String#search(para, target, smith_min=nil, comp_min=nil, smith_max=10000, comp_max=10000, left_associative: true, step: 1, cut_exp: Float::INFINITY, min_smith: false)`
+`c_min=comp_search(para, target, smith_max, comp_min, comp_max)` から `c_max=comp_search(para, target, smith_max, comp_min, comp_max)` まで，`step`ずつ動かして，
+`smith_search`を行い，その過程で得られた最小経験値の鍛冶・防具製作Lvと道具製作Lvからなる配列を返します．
+レシピ中の，対象パラメータの種別値がすべて奇数，または全て偶数であるなら，`step`を`2`にしても探索すべき範囲を網羅できます．
+`cut_exp`以下の経験値で`target`以上を達成できない場合，`Mgmg::SearchCutException`を発生します．
+
+### `Enumerable#search(para, target, smith_min=nil, armor_min=nil, comp_min=nil, smith_max=10000, armor_max=10000, comp_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)`
+複数装備の組について，`para`の値が`target`以上となる最小経験値の`[鍛冶Lv，防具製作Lv，道具製作Lv]`を返します．
+武器のみなら防具製作Lvは`0`，防具のみなら鍛冶Lvは`0`，合成なしなら道具製作Lvは`0`となります．
+`cut_exp`以下の経験値で`target`以上を達成できない場合，`Mgmg::SearchCutException`を発生します．
+
 ### `String#eff(para, smith, comp=smith, left_associative: true)`
 [`smith`を1上げたときの`para`値/(`smith`を1上げるのに必要な経験値), `comp`を1上げたときの`para`値/(`comp`を2上げるのに必要な経験値)]を返します．
 `para`は，`Mgmg::Equip`のメソッド名をシンボルで指定(`:power, :fpower`も可)します．

data/lib/mgmg.rb

@@ -4,6 +4,7 @@ require_relative './mgmg/const'
 require_relative './mgmg/equip'
 require_relative './mgmg/poly'
 require_relative './mgmg/system_equip'
+require_relative './mgmg/search'
 
 class String
 	def min_level(w=1)
@@ -22,36 +23,37 @@ class String
 		Mgmg::Equip.build(self, smith, comp, left_associative: left_associative)
 	end
 	def poly(para=:cost, left_associative: true)
+		la = left_associative
 		case para
 		when :atkstr
-			self.poly(:attack) + self.poly(:str)
+			self.poly(:attack, left_associative: la) + self.poly(:str, left_associative: la)
 		when :atk_sd
-			self.poly(:attack) + self.poly(:str).quo(2) + self.poly(:dex).quo(2)
+			self.poly(:attack) + self.poly(:str, left_associative: la).quo(2) + self.poly(:dex, left_associative: la).quo(2)
 		when :dex_as
-			self.poly(:dex) + self.poly(:attack).quo(2) + self.poly(:str).quo(2)
+			self.poly(:dex) + self.poly(:attack, left_associative: la).quo(2) + self.poly(:str, left_associative: la).quo(2)
 		when :mag_das
-			self.poly(:magic) + self.poly(:dex_as).quo(2)
+			self.poly(:magic) + self.poly(:dex_as, left_associative: la).quo(2)
 		when :magmag
-			self.poly(:magdef) + self.poly(:magic).quo(2)
+			self.poly(:magdef) + self.poly(:magic, left_associative: la).quo(2)
 		when :cost
 			if Mgmg::SystemEquip.keys.include?(self)
 				return Mgmg::TPolynomial.new(Mgmg::Mat.new(1, 1, 0.quo(1)), 28, 0, 12, 12)
 			end
 			built = self.build(-1)
 			const = (built.star**2) * ( /\+/.match(self) ? 5 : ( built.kind < 8 ? 2 : 1 ) )
-			ret = poly(:attack) + poly(:phydef) + poly(:magdef)
-			ret += poly(:hp).quo(4) + poly(:mp).quo(4)
-			ret += poly(:str) + poly(:dex) + poly(:speed) + poly(:magic)
+			ret = poly(:attack, left_associative: la) + poly(:phydef, left_associative: la) + poly(:magdef, left_associative: la)
+			ret += poly(:hp, left_associative: la).quo(4) + poly(:mp, left_associative: la).quo(4)
+			ret += poly(:str, left_associative: la) + poly(:dex, left_associative: la) + poly(:speed, left_associative: la) + poly(:magic, left_associative: la)
 			ret.mat.body[0][0] += const
 			ret
 		else
-			Mgmg::TPolynomial.build(self, para, left_associative: left_associative)
+			Mgmg::TPolynomial.build(self, para, left_associative: la)
 		end
 	end
 	def eff(para, smith, comp=smith, left_associative: true)
-		a = build(smith, comp, left_associative: left_associative).method(para).call
-		b = build(smith+1, comp, left_associative: left_associative).method(para).call
-		c = build(smith, comp+2, left_associative: left_associative).method(para).call
+		a = build(smith, comp, left_associative: left_associative).para_call(para)
+		b = build(smith+1, comp, left_associative: left_associative).para_call(para)
+		c = build(smith, comp+2, left_associative: left_associative).para_call(para)
 		sden = smith==0 ? 1 : 2*smith-1
 		cden = comp==0 ? 4 : 8*comp
 		[(b-a).quo(sden), (c-a).quo(cden)]
@@ -59,46 +61,6 @@ class String
 	def peff(para, smith, comp=smith, left_associative: true)
 		poly(para, left_associative: left_associative).eff(smith, comp)
 	end
-	def smith_search(para, target, comp, smith_min=nil, smith_max=10000, left_associative: true)
-		smith_min = build(-1, -1, left_associative: left_associative).min_level if smith_min.nil?
-		if smith_max < smith_min
-			raise ArgumentError, "smith_min <= smith_max is needed, (smith_min, smith_max) = (#{smith_min}, #{smith_max}) are given"
-		end
-		if target <= build(smith_min, comp, left_associative: left_associative).method(para).call
-			return smith_min
-		elsif build(smith_max, comp, left_associative: left_associative).method(para).call < target
-			raise ArgumentError, "given smith_max=#{smith_max} does not satisfies the target"
-		end
-		while 1 < smith_max - smith_min do
-			smith = (smith_max - smith_min).div(2) + smith_min
-			if build(smith, comp, left_associative: left_associative).method(para).call < target
-				smith_min = smith
-			else
-				smith_max = smith
-			end
-		end
-		smith_max
-	end
-	def comp_search(para, target, smith, comp_min=nil, comp_max=10000, left_associative: true)
-		comp_min = min_comp(left_associative: left_associative)
-		if comp_max < comp_min
-			raise ArgumentError, "comp_min <= comp_max is needed, (comp_min, comp_max) = (#{comp_min}, #{comp_max}) are given"
-		end
-		if target <= build(smith, comp_min, left_associative: left_associative).method(para).call
-			return comp_min
-		elsif build(smith, comp_max, left_associative: left_associative).method(para).call < target
-			raise ArgumentError, "given comp_max=#{comp_max} does not satisfies the target"
-		end
-		while 1 < comp_max - comp_min do
-			comp = (comp_max - comp_min).div(2) + comp_min
-			if build(smith, comp, left_associative: left_associative).method(para).call < target
-				comp_min = comp
-			else
-				comp_max = comp
-			end
-		end
-		comp_max
-	end
 	def show(smith=-1, comp=smith, left_associative: true)
 		built = self.build(smith, comp, left_associative: left_associative)
 		pstr = '%.3f' % built.fpower
@@ -120,4 +82,37 @@ module Enumerable
 			end
 		end.sum
 	end
+	def min_levels(left_associative: true)
+		build(-1, -1, -1, left_associative: left_associative).min_levels
+	end
+	def min_level(left_associative: true)
+		ret = [0, 0]
+		build(-1, -1, -1, left_associative: left_associative).min_levels.each do |str, level|
+			m = /\A\[*([^\+]+)/.match(str)
+			if Mgmg::EquipPosition[m[1].build(0).kind] == 0
+				ret[0] = [ret[0], level].max
+			else
+				ret[1] = [ret[1], level].max
+			end
+		end
+		ret
+	end
+	def min_smith(left_associative: true)
+		ret = [0, 0]
+		self.each do |str|
+			s = Mgmg::Equip.min_smith(str, left_associative: left_associative)
+			m = /\A\[*([^\+]+)/.match(str)
+			if Mgmg::EquipPosition[m[1].build(0).kind] == 0
+				ret[0] = [ret[0], s].max
+			else
+				ret[1] = [ret[1], s].max
+			end
+		end
+		ret
+	end
+	def min_comp(left_associative: true)
+		self.map do |str|
+			Mgmg::Equip.min_comp(str, left_associative: left_associative)
+		end.max
+	end
 end

data/lib/mgmg/equip.rb

@@ -72,6 +72,10 @@ module Mgmg
 			end
 		end
 		
+		def para_call(para)
+			method(para).call
+		end
+		
 		%i|attack phydef magdef hp mp str dex speed magic|.each.with_index do |s, i|
 			define_method(s){ @para[i] }
 		end

data/lib/mgmg/search.rb

@@ -0,0 +1,230 @@
+class String
+	def smith_search(para, target, comp, smith_min=nil, smith_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)
+		if smith_min.nil?
+			if min_smith
+				smith_min = self.min_smith.min_smith
+			else
+				smith_min = build(-1, -1, left_associative: left_associative).min_level
+			end
+		end
+		if smith_max < smith_min
+			raise ArgumentError, "smith_min <= smith_max is needed, (smith_min, smith_max) = (#{smith_min}, #{smith_max}) are given"
+		elsif cut_exp < Float::INFINITY
+			begin
+				smith_max = [smith_max, Mgmg.invexp2(cut_exp, comp)].min
+			rescue
+				raise Mgmg::SearchCutException
+			end
+		end
+		if target <= build(smith_min, comp, left_associative: left_associative).para_call(para)
+			return smith_min
+		elsif build(smith_max, comp, left_associative: left_associative).para_call(para) < target
+			raise Mgmg::SearchCutException
+		end
+		while 1 < smith_max - smith_min do
+			smith = (smith_max - smith_min).div(2) + smith_min
+			if build(smith, comp, left_associative: left_associative).para_call(para) < target
+				smith_min = smith
+			else
+				smith_max = smith
+			end
+		end
+		smith_max
+	end
+	def comp_search(para, target, smith, comp_min=nil, comp_max=10000, left_associative: true)
+		comp_min = min_comp(left_associative: left_associative)
+		if comp_max < comp_min
+			raise ArgumentError, "comp_min <= comp_max is needed, (comp_min, comp_max) = (#{comp_min}, #{comp_max}) are given"
+		end
+		if target <= build(smith, comp_min, left_associative: left_associative).para_call(para)
+			return comp_min
+		elsif build(smith, comp_max, left_associative: left_associative).para_call(para) < target
+			raise Mgmg::SearchCutException
+		end
+		while 1 < comp_max - comp_min do
+			comp = (comp_max - comp_min).div(2) + comp_min
+			if build(smith, comp, left_associative: left_associative).para_call(para) < target
+				comp_min = comp
+			else
+				comp_max = comp
+			end
+		end
+		comp_max
+	end
+	def search(para, target, smith_min=nil, comp_min=nil, smith_max=10000, comp_max=10000, left_associative: true, step: 1, cut_exp: Float::INFINITY, min_smith: false)
+		if smith_min.nil?
+			if min_smith
+				smith_min = self.min_smith
+			else
+				smith_min = build(-1, -1, left_associative: left_associative).min_level
+			end
+		end
+		comp_min = min_comp(left_associative: left_associative) if comp_min.nil?
+		comp_min = comp_search(para, target, smith_max, comp_min, comp_max, left_associative: left_associative)
+		smith_max = smith_search(para, target, comp_min, smith_min, smith_max, left_associative: left_associative)
+		smith_min = smith_search(para, target, comp_max, smith_min, smith_max, left_associative: left_associative)
+		raise Mgmg::SearchCutException if cut_exp < Mgmg.exp(smith_min, comp_min)
+		comp_max = comp_search(para, target, smith_min, comp_min, comp_max, left_associative: left_associative)
+		minex, ret = Mgmg.exp(smith_min, comp_max), [smith_min, comp_max]
+		exp = Mgmg.exp(smith_max, comp_min)
+		minex, ret = exp, [smith_max, comp_min] if exp < minex
+		(comp_min+step).step(comp_max-1, step) do |comp|
+			break if minex < Mgmg.exp(smith_min, comp)
+			smith = smith_search(para, target, comp, smith_min, smith_max, left_associative: left_associative, cut_exp: [minex, cut_exp].min)
+			exp = Mgmg.exp(smith, comp)
+			minex, ret = exp, [smith, comp] if exp < minex
+		rescue Mgmg::SearchCutException
+		end
+		raise Mgmg::SearchCutException, "the result exceeds given cut_exp=#{cut_exp}" if cut_exp < minex
+		ret
+	end
+end
+module Enumerable
+	def smith_search(para, target, armor, comp, smith_min=nil, smith_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)
+		if smith_min.nil?
+			if min_smith
+				smith_min = self.min_smith[0]
+			else
+				smith_min = build(-1, -1, -1, left_associative: left_associative).min_level[0]
+			end
+		end
+		if smith_max < smith_min
+			raise ArgumentError, "smith_min <= smith_max is needed, (smith_min, smith_max) = (#{smith_min}, #{smith_max}) are given"
+		elsif cut_exp < Float::INFINITY
+			begin
+				smith_max = [smith_max, Mgmg.invexp3(cut_exp, armor, comp)].min
+			rescue
+				raise Mgmg::SearchCutException
+			end
+		end
+		if build(smith_max, armor, comp, left_associative: left_associative).para_call(para) < target
+			raise Mgmg::SearchCutException
+		elsif target <= build(smith_min, armor, comp, left_associative: left_associative).para_call(para)
+			return smith_min
+		end
+		while 1 < smith_max - smith_min do
+			smith = (smith_max - smith_min).div(2) + smith_min
+			if build(smith, armor, comp, left_associative: left_associative).para_call(para) < target
+				smith_min = smith
+			else
+				smith_max = smith
+			end
+		end
+		smith_max
+	end
+	def armor_search(para, target, smith, comp, armor_min=nil, armor_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)
+		if armor_min.nil?
+			if min_smith
+				armor_min = self.min_smith[1]
+			else
+				armor_min = build(-1, -1, -1, left_associative: left_associative).min_level[1]
+			end
+		end
+		if armor_max < armor_min
+			raise ArgumentError, "armor_min <= armor_max is needed, (armor_min, armor_max) = (#{armor_min}, #{armor_max}) are given"
+		elsif cut_exp < Float::INFINITY
+			begin
+				armor_max = [armor_max, Mgmg.invexp3(cut_exp, smith, comp)].min
+			rescue
+				raise Mgmg::SearchCutException
+			end
+		end
+		if build(smith, armor_max, comp, left_associative: left_associative).para_call(para) < target
+			raise Mgmg::SearchCutException
+		elsif target <= build(smith, armor_min, comp, left_associative: left_associative).para_call(para)
+			return armor_min
+		end
+		while 1 < armor_max - armor_min do
+			armor = (armor_max - armor_min).div(2) + armor_min
+			if build(smith, armor, comp, left_associative: left_associative).para_call(para) < target
+				armor_min = armor
+			else
+				armor_max = armor
+			end
+		end
+		armor_max
+	end
+	def sa_search(para, target, comp, smith_min=nil, armor_min=nil, smith_max=10000, armor_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)
+		if min_smith
+			s, a = self.min_smith
+		else
+			s, a = build(-1, -1, -1, left_associative: left_associative).min_level
+		end
+		smith_min = s if smith_min.nil?
+		armor_min = a if armor_min.nil?
+		smith_min = smith_search(para, target, armor_max, comp, smith_min, smith_max, left_associative: true)
+		armor_min = armor_search(para, target, smith_max, comp, armor_min, armor_max, left_associative: true)
+		raise Mgmg::SearchCutException if cut_exp < Mgmg.exp(smith_min, armor_min, comp)
+		smith_max = smith_search(para, target, armor_min, comp, smith_min, smith_max, left_associative: true)
+		armor_max = armor_search(para, target, smith_min, comp, armor_min, armor_max, left_associative: true)
+		minex, ret = Mgmg.exp(smith_min, armor_max, comp), [smith_min, armor_max]
+		exp = Mgmg.exp(smith_max, armor_min, comp)
+		if exp < minex
+			minex, ret = exp, [smith_max, armor_min]
+			(armor_min+1).upto(armor_max-1) do |armor|
+				break if minex < Mgmg.exp(smith_min, armor, comp)
+				smith = smith_search(para, target, armor, comp, smith_min, smith_max, left_associative: left_associative, cut_exp: [minex, cut_exp].min)
+				exp = Mgmg.exp(smith, armor, comp)
+				minex, ret = exp, [smith, armor] if exp < minex
+			rescue Mgmg::SearchCutException
+			end
+		else
+			(smith_min+1).upto(smith_max-1) do |smith|
+				break if minex < Mgmg.exp(smith, armor_min, comp)
+				armor = armor_search(para, target, smith, comp, armor_min, armor_max, left_associative: left_associative, cut_exp: [minex, cut_exp].min)
+				exp = Mgmg.exp(smith, armor, comp)
+				minex, ret = exp, [smith, armor] if exp < minex
+			rescue Mgmg::SearchCutException
+			end
+		end
+		raise Mgmg::SearchCutException if cut_exp < minex
+		ret
+	end
+	def comp_search(para, target, smith, armor, comp_min=nil, comp_max=10000, left_associative: true)
+		comp_min = min_comp(left_associative: left_associative)
+		if comp_max < comp_min
+			raise ArgumentError, "comp_min <= comp_max is needed, (comp_min, comp_max) = (#{comp_min}, #{comp_max}) are given"
+		end
+		if target <= build(smith, armor, comp_min, left_associative: left_associative).para_call(para)
+			return comp_min
+		elsif build(smith, comp_max, left_associative: left_associative).para_call(para) < target
+			raise ArgumentError, "given comp_max=#{comp_max} does not satisfies the target"
+		end
+		while 1 < comp_max - comp_min do
+			comp = (comp_max - comp_min).div(2) + comp_min
+			if build(smith, armor, comp, left_associative: left_associative).para_call(para) < target
+				comp_min = comp
+			else
+				comp_max = comp
+			end
+		end
+		comp_max
+	end
+	def search(para, target, smith_min=nil, armor_min=nil, comp_min=nil, smith_max=10000, armor_max=10000, comp_max=10000, left_associative: true, cut_exp: Float::INFINITY, min_smith: false)
+		if min_smith
+			s, a = self.min_smith
+		else
+			s, a = build(-1, -1, -1, left_associative: left_associative).min_level
+		end
+		smith_min = s if smith_min.nil?
+		armor_min = a if armor_min.nil?
+		comp_min = min_comp(left_associative: left_associative) if comp_min.nil?
+		comp_min = comp_search(para, target, smith_max, armor_max, comp_min, comp_max, left_associative: left_associative)
+		smith_max, armor_max = sa_search(para, target, comp_min, smith_min, armor_min, smith_max, armor_max, left_associative: left_associative)
+		smith_min, armor_min = sa_search(para, target, comp_max, smith_min, armor_min, smith_max, armor_max, left_associative: left_associative)
+		raise Mgmg::SearchCutException if cut_exp < Mgmg.exp(smith_min, armor_min, comp_min)
+		comp_max = comp_search(para, target, smith_min, armor_min, comp_min, comp_max, left_associative: left_associative)
+		minex, ret = Mgmg.exp(smith_min, armor_min, comp_max), [smith_min, armor_min, comp_max]
+		exp = Mgmg.exp(smith_max, armor_max, comp_min)
+		minex, ret = exp, [smith_max, armor_max, comp_min] if exp < minex
+		(comp_min+1).upto(comp_max-1) do |comp|
+			break if minex < Mgmg.exp(smith_min, armor_min, comp)
+			smith, armor = sa_search(para, target, comp, smith_min, armor_min, smith_max, armor_max, left_associative: left_associative, cut_exp: [minex, cut_exp].min)
+			exp = Mgmg.exp(smith, armor, comp)
+			minex, ret = exp, [smith, armor, comp] if exp < minex
+		rescue Mgmg::SearchCutException
+		end
+		raise Mgmg::SearchCutException, "the result exceeds given cut_exp=#{cut_exp}" if cut_exp < minex
+		ret
+	end
+end

data/lib/mgmg/utils.rb

@@ -46,9 +46,44 @@ module Mgmg
 		end
 		attr_accessor :equip
 	end
+	class SearchCutException < StandardError; end
 	
-	module_function def exp(smith, comp)
-		((smith-1)**2) + (2*((comp-1)**2)) + 3
+	module_function def exp(smith, armor, comp=armor.tap{armor=0})
+		if armor <= 0
+			if smith <= 0
+				if comp <= 0
+					0
+				else
+					(2*((comp-1)**2)) + 2
+				end
+			else
+				if comp <= 0
+					((smith-1)**2) + 1
+				else
+					((smith-1)**2) + (2*((comp-1)**2)) + 3
+				end
+			end
+		else
+			if smith <= 0
+				if comp <= 0
+					((armor-1)**2) + 1
+				else
+					((armor-1)**2) + (2*((comp-1)**2)) + 3
+				end
+			else
+				if comp <= 0
+					((smith-1)**2) + ((armor-1)**2) + 2
+				else
+					((smith-1)**2) + ((armor-1)**2) + (2*((comp-1)**2)) + 4
+				end
+			end
+		end
+	end
+	module_function def invexp2(exp, comp)
+		Math.sqrt(exp - (2*((comp-1)**2)) - 3).round + 1
+	end
+	module_function def invexp3(exp, sa, comp)
+		Math.sqrt(exp - ((sa-1)**2) - (2*((comp-1)**2)) - 4).round + 1
 	end
 	
 	CharacterList = /[^\(\)\+0123456789\[\]あきくしすたてなねのびりるイウガクグサジスタダチツデトドニノフブペボムラリルロンヴー一万二光兜典刀剣劣匠双古名吹咆品哮地大天太子安宝小帽弓弩当息悪戦手指斧書服木本杖業樹歴殺水氷法火炎牙物玉王産用界異的皮盾短石砕竜紫綿耳聖脛腕腿般良色衣袋覇質軍軽輝輪重量金鉄鎧闇陽靴額飾首骨鬼龍]/

data/lib/mgmg/version.rb

@@ -1,3 +1,3 @@
 module Mgmg
-  VERSION = "1.3.0"
+  VERSION = "1.3.1"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mgmg
 version: !ruby/object:Gem::Version
-  version: 1.3.0
+  version: 1.3.1
 platform: ruby
 authors:
 - KAZOON
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-08-26 00:00:00.000000000 Z
+date: 2020-08-31 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -71,6 +71,7 @@ files:
 - lib/mgmg/const.rb
 - lib/mgmg/equip.rb
 - lib/mgmg/poly.rb
+- lib/mgmg/search.rb
 - lib/mgmg/system_equip.rb
 - lib/mgmg/utils.rb
 - lib/mgmg/version.rb