search.rb
# Checks if the current branch is the root node's best variation,
#   if it is the next move will go first
Checks if the current branch is the root node's best variation,
if it is the next move will go first
Checks if the current branch is the root node ' s best variation if it is the next move will go first
def assert_pv(i, n)
    @on_pv = false
    return nil if @pv[@root][@ply].nil?
    i.upto(n) do |j|
      if @mv[@mv_idx[j]] == @pv[@root][@ply]
        @mv_score[@mv_idx[j]] += 99999999
        @on_pv = true
        return nil
      end
    end
    nil
  end
def assert_pv ( i , n ) @on_pv = false return nil if @pv [ @root ] [ @ply ] . nil? i . upto ( n ) do | j | if @mv [ @mv_idx [ j ] ] == @pv [ @root ] [ @ply ] @mv_score [ @mv_idx [ j ] ] += 99999999 @on_pv = true return nil end end nil end
Checks if the current branch is the root node's best variation,
if it is the next move will go first
Checks if the current branch is the root node ' s best variation if it is the next move will go first
i
<not_specific>
n
<not_specific>