Emil
We have now been working on several different modifications for the last few months. The 6 modifications we chose for testing (combination) were; Mixmax, Macro actions, Partial Expansion, Roulette Wheel Selection, Hole Detection and Limited Actions. We tested all combinations of these modifications to the basic MCTS algorithm and found that the best solution was with everything but Macro Actions enabled. We play four levels in this video and the first one is the only one we have seen this final combination fail in. Even though it is definately possible that it can die in others, it is much more unlikely than our basic implementation of MCTS UCT.
The red line from Mario is where he anticipates to go from this point. You can see that it will constantly change which reveals the ‘random’ nature of the MCTS algorithm since the building of the tree can be different even for the same environment due to differences in CPU scheduling and thereby calculation time.
The music is Piano Wire by Ronald Jenkees and can be bought here; https://www.ronaldjenkees.com/mp3-store/
Source
Very impressive stuff !
Any analysis of the resource requirements of the computations?
so coooooooooooooooooooooooooooool!
so sexy