 The algorithm provides near-linear speedup with some problems and scales extremely well.It was published about by John Romein, Aske Plaat, Henri Bal and Jonathan Schaeffer.In a puzzle, all possible plays can be represented in a tree with board positions corresponding to the nodes, moves corresponding to the edges, the initial position as the root of the tree and the solutions as leaves.