Back to Mover page.
Performs something approximating r++ prepacking (but less rigorously without rotamer-trial minimization) by doing sc minimization and repacking. Separates chains based on jump_num, does prepacking, then reforms the complex. If jump_num=0, then it will NOT separate chains at all.
<Prepack name="(&string)" scorefxn="(score12 &string)" jump_number="(1 &integer)" task_operations="(comma-delimited list)" min_bb="(0 &bool)"/> <MoveMap> ... </MoveMap> </Prepack>