In this paper I will describe algorithm for Black-box optimization problems. The algorithm
will be tested against two types of test functions, additively decomposable functions and hierarchical
functions. Subject to testing, the number of evaluations needed to reliably find the global
optima. Results will be compared with results of two genetic algorithms ECGA and BOA.