Method generateSol9

biteopt.h:1333–1364

	 */

	void generateSol9( CBiteRnd& rnd )
	{
		ptype* const Params = TmpParams;

		const ptype* const rp1 = getParamsOrdered(
			rnd.getInt( CurPopSize ));

		const ptype* const rp2 = getParamsOrdered(
			rnd.getSqrIntInv( CurPopSize ));

		int i;

		// Such overall sign inversion seems unuseful, but has benefits in
		// practice.

		if( rnd.getBit() )
		{
			for( i = 0; i < ParamCount; i++ )
			{
				Params[ i ] = rp1[ i ] - (( rp2[ i ] - rp1[ i ]) >> 1 ) *
					( 1 - 2 * rnd.getBit() );
			}
		}
		else
		{
			for( i = 0; i < ParamCount; i++ )
			{
				Params[ i ] = rp1[ i ] + (( rp2[ i ] - rp1[ i ]) >> 1 ) *
					( 1 - 2 * rnd.getBit() );
			}
		}
	}

	/**
	 * Solution generator based on SpherOpt's converging hyper-spheroid.