RHEA [1]} evolves a sequence of \(L=10\)  actions over several generations, choosing the first action of the best sequence found to play in the game. The algorithm is randomly initialised with a sequence of actions. At each generation it creates a mutation of the current best solution, keeping the best solution of the two. This process repeats until the given budget is exhausted.
