Learn More
The set of tree-recursive algorithms is large, including constraint satisfaction using back-tracking, iterative-deepening search such as IDA*, depth-first branch-and-bound, two-player game minimax search, and many divide-and-conquer algorithms. We describe a structured method for implementing such algorithms on SIMD machines, and identify measures for(More)
  • 1