A parallel search by splitting the root. The legal moves are put in a queue and each worker takes the next move, searches the position after it, and reports back. The best score wins. The workers cannot share a bound the way alpha-beta does within one search, so the speed up is less than the number of workers, and as a bonus you get a score for every root move. When the workers finish, one ordinary search of the same position runs for comparison.