Terrance L. Seethoff

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
Let each leaf in a bi-valued game tree have the same probability P<subscrpt>O</subscrpt> of being labeled a WIN. Define a search algorithm D for a bi-valued game tree T to be directed if D consists of searching T by adhering to a predetermined ordering of the leaves of T, an ordering which is independent both of P<subscrpt>O</subscrpt> and of the assignment(More)
  • 1