src/puzzle.cpp
//==============================================
// 95 Quick is a partial processing for nested + forcing chains
//    and nested + multi chains
// can be used to reduce the number of puzzles when looking for hardest puzzles
95 Quick is a partial processing for nested + forcing chains
and nested + multi chains
can be used to reduce the number of puzzles when looking for hardest puzzles
95 Quick is a partial processing for nested + forcing chains and nested + multi chains can be used to reduce the number of puzzles when looking for hardest puzzles
void PUZZLE::InitNested() { 
	if(options.ot) {
		EE.Enl("Init  nested levels  ");
	}
	opp = 0;
	zcf.h.dp = zcf.hdp_dynamic; 
	zcf.ExpandAll();
	zcf.LockNestedOne();
	zcx.LockNestedOne();
	zcxb.LockNestedOne();
}
void PUZZLE :: InitNested ( ) { if ( options . ot ) { EE . Enl ( " " ) ; } opp = 0 ; zcf . h . dp = zcf . hdp_dynamic ; zcf . ExpandAll ( ) ; zcf . LockNestedOne ( ) ; zcx . LockNestedOne ( ) ; zcxb . LockNestedOne ( ) ; }
95 Quick is a partial processing for nested + forcing chains
and nested + multi chains
can be used to reduce the number of puzzles when looking for hardest puzzles
95 Quick is a partial processing for nested + forcing chains and nested + multi chains can be used to reduce the number of puzzles when looking for hardest puzzles
// common part before starting nested processing // lock the start situation with fully expanded  hdp from step 90 // restore the index in zcf  // not derived weak links //zcf.h_one.d.Image();