N. Srimani

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A new sequential tree searching algorithm (PS*) is presented. Based on SSS*, Phased Search (PS*) divides each MAX node into k partitions, which are then searched in sequence. By this means two major disadvantages of SSS*, storage demand and maintenance overhead, are significantly reduced, although the corresponding increase in nodes visited is less apparent(More)
PS*, a new sequential tree searching algorithm based on the State Space Search (SSS*), is presented. PS*(k) divides each MAX node of a game tree into k partitions, which are then searched in sequence. By this means two major disadvantages of SSS*, storage demand and maintenance overhead, are significantly reduced, and yet the corresponding increase in nodes(More)
  • 1