Recipe: Quick Shake Algorithm

created by Seagat2011

Profile

• Name: Quick Shake Algorithm
• ID: 100185
• Shared with: Public
• Parent: None
• Children: None
• Created on: November 05, 2014 at 18:33 PM UTC
• Updated on: November 05, 2014 at 18:33 PM UTC
• Description:

  Algorithm for faster Shake.

Code

--[[------------------------------------------------------------------------------------------------
-- Algorithm for faster shake

REFERENCES
1. N/A

Copyright (C) 2014 Seagat2011 <http://fold.it/port/user/1992490>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.

$Id$

------------------------------------------------------------------------------------------------]]--

--[[

v1
- Inception

1.2
- Loops until nogain 

]]--

local idx  = 1
local idx2 = structure.GetCount ()
local hash = {}
local cs   = current.GetScore ()

print ( 'Quick Shake Algorithm v1.2 SG2011 - Current Score: '..cs )

local function New ( obj )
  return obj -- pass-new-obj-by-value
end

local _gses = New ( current.GetSegmentEnergySubscore )

local function SmartShake ( iters ) 
  local gain = true
  while (gain) do
    gain = false
    for i=idx,idx2 do
      local ci = _gses ( i,'clashing' ) 
      if ci <  _gses ( i,'hiding'   ) and
         ci <  _gses ( i,'packing'  ) and
         ci <  _gses ( i,'ideality' ) and
         ci <  _gses ( i,'sidechain') and
         ci <  _gses ( i,'bonding'  ) and
         ci <  _gses ( i,'other'    ) and
         ci <  _gses ( i,'reference') then
        selection.Select ( i )
      end -- test ci --
    end -- loop --
    if selection.GetCount () then
      local css = current.GetScore ()
      structure.ShakeSidechainsSelected ( iters )
      selection.DeselectAll () 
      if current.GetScore () > css then 
        gain = true 
      end -- test --
    end -- test --
  end -- loopf --
end

structure.SmartShake = SmartShake

structure.SmartShake ( 1 )

print ( 'Done.' )

Comments

[Seagat2011]

Recipe analyzes only "clashing" subscore-part as consideration to perform Shake ()

[Bruno Kestemont]

Great idea. This will help us make a generation of faster recipes! Shake (and mutate) are quite boring long processes.

May be an idea that could be implemented in the Foldit Shake algorithm itself if it proves to be efficient.