A Nested Monte Carlo Search is a promising approach to find good solutions for complex single player games such as SameGame.
How does it work?
And how can it be implemented in a generic way so that it can be adapted to other problems, games or puzzles?