How to allocate hard candies fairly

We consider the problem of allocating a finite number of indivisible items to two players with additive utilities. We design a procedure that looks for all the maximin allocations and makes repeated use of an extension of the Adjusted Winner, an effective procedure that deals with divisible items, to find new candidate solutions, and to suggest which items should be assigned to the players.