We present results of solving various types of optimization problems on the Advantage QPU and on the HSS version 2. The first set of optimization problems consists of garden optimization problems, sizeable optimization problems with constraints. The task is to fill and place pots taking into account the characteristics of neighboring plants. The number of variables is given by the number of pots multiplied by the number of plant species and the number plants is equal to the number of pots (one plant per pot). The second set of optimization problems comprises exact cover problems and the third set 2-SAT problems.