• It looks like Monte Carlo Tree Search gives the best speedups compared to an CPU implementation.
• The Node Based Parallel Search is an hybrid approach that offloads computational tasks to the GPU.
• MiniMax search can be parallelized on the GPU, but is inferior to AlphaBeta.
• Speedup of parallel AlphaBeta implementations depend on the branching factor of the Game.

So far i have found nothing about an implementation that makes use of the recursive features of newer architectures.